|
|
A031974
|
|
1 repeated prime(n) times.
|
|
22
|
|
|
11, 111, 11111, 1111111, 11111111111, 1111111111111, 11111111111111111, 1111111111111111111, 11111111111111111111111, 11111111111111111111111111111, 1111111111111111111111111111111, 1111111111111111111111111111111111111
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
Salomaa's first example of an infinite language. - N. J. A. Sloane, Dec 05 2012
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
|
|
REFERENCES
|
A. Salomaa, Jewels of Formal Language Theory. Computer Science Press, Rockville, MD, 1981, p. 2. - From N. J. A. Sloane, Dec 05 2012
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
f:=n->(10^ithprime(n)-1)/9; [seq(f(n), n=1..20)]; # N. J. A. Sloane, Dec 05 2012
|
|
MATHEMATICA
|
Table[FromDigits[PadRight[{}, Prime[n], 1]], {n, 15}] (* Harvey P. Dale, Apr 10 2012 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,base
|
|
AUTHOR
|
J. Castillo (arp(AT)cia-g.com) [Broken email address?]
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|