login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A290390 Double repunit numbers: repunits with repunit indices. 0
0, 1, 11111111111, 111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111111 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
a(3) has 111 digits.
As in the case of A077585, where a necessary condition for a term to be prime is that its index is a Mersenne prime, a necessary (but not sufficient) condition for a term of this sequence to be prime is that the number of ones is a repunit prime, i.e., A055642(a(n)) must be a term of A004022.
Are there any primes in this sequence? In other words, is there a term of A004022 that is also a term of A004023?
Second sequence in the hierarchy of sequences obtained by successive numbers of nestings of the form A002275(...A002275(n)...). All higher order sequences in this hierarchy grow much too fast to be included in the OEIS.
LINKS
FORMULA
a(n) = A002275(A002275(n)).
MATHEMATICA
Table[Nest[FromDigits@ ConstantArray[1, #] &, n, 2], {n, 0, 3}] (* Michael De Vlieger, Jul 30 2017 *)
PROG
(PARI) a002275(n) = (10^n-1)/9
a(n) = a002275(a002275(n))
CROSSREFS
Sequence in context: A295464 A095426 A038453 * A183709 A247312 A204780
KEYWORD
nonn,base,easy,bref
AUTHOR
Felix Fröhlich, Jul 29 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 28 05:39 EDT 2024. Contains 371235 sequences. (Running on oeis4.)