# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a031974 Showing 1-1 of 1 %I A031974 #52 Feb 16 2025 08:32:36 %S A031974 11,111,11111,1111111,11111111111,1111111111111,11111111111111111, %T A031974 1111111111111111111,11111111111111111111111, %U A031974 11111111111111111111111111111,1111111111111111111111111111111,1111111111111111111111111111111111111 %N A031974 1 repeated prime(n) times. %C A031974 Salomaa's first example of an infinite language. - _N. J. A. Sloane_, Dec 05 2012 %C A031974 If p is a prime and gcd(p,b-1)=1, then (b^p-1)/(b-1) == 1 (mod p); by Fermat's little theorem. For example 1111111 == 1 (mod 7). - _Thomas Ordowski_, Apr 09 2016 %D A031974 A. Salomaa, Jewels of Formal Language Theory. Computer Science Press, Rockville, MD, 1981, p. 2. - From _N. J. A. Sloane_, Dec 05 2012 %H A031974 N. J. A. Sloane, Table of n, a(n) for n = 1..50 %H A031974 Fanel Iacobescu, Smarandache Partition Type Sequences, in Bulletin of Pure and Applied Sciences, India, Vol. 16E, No. 2, 1997, pp. 237-240 %H A031974 M. Le and K. Wu, The Primes in the Smarandache Unary Sequence, Smarandache Notions Journal, Vol. 9, No. 1-2. 1998, 98-99. %H A031974 Eric Weisstein's World of Mathematics, Smarandache Sequences %F A031974 a(n) = A000042(A000040(n)). - _Jason Kimberley_, Dec 19 2012 %F A031974 a(n) = (10^prime(n) - 1)/9. - _Vincenzo Librandi_, May 29 2014 %p A031974 f:=n->(10^ithprime(n)-1)/9; [seq(f(n),n=1..20)]; # _N. J. A. Sloane_, Dec 05 2012 %t A031974 Table[FromDigits[PadRight[{},Prime[n],1]],{n,15}] (* _Harvey P. Dale_, Apr 10 2012 *) %o A031974 (Magma) [(10^p-1)/9: p in PrimesUpTo(40)]; // _Vincenzo Librandi_, May 29 2014 %Y A031974 A004022 is the subsequence of primes. - _Jeppe Stig Nielsen_, Sep 14 2014 %K A031974 nonn,easy,base %O A031974 1,1 %A A031974 J. Castillo (arp(AT)cia-g.com) [Broken email address?] %E A031974 More terms from _Erich Friedman_ %E A031974 Corrected and extended by _Harvey P. Dale_, Apr 10 2012 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE