|
| |
|
|
A065374
|
|
Smallest k such that f(f(...f(k))) > 1, where f(k) = A065371(k) is iterated n times.
|
|
4
|
|
|
|
5, 13, 29, 43, 61, 307, 383, 2689, 9209, 14897, 83557, 274679, 598333, 3516973, 11295673, 24104629
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,1
|
|
|
COMMENTS
|
This sequence contains only prime numbers. - Paul Tek, Jun 10 2013
|
|
|
LINKS
|
Table of n, a(n) for n=1..16.
Paul Tek, C++ program for this sequence
|
|
|
EXAMPLE
|
a(2) = 13 because A065372(13) = 3 and A065372(i) = 1 for i < 13.
After 10 iterations of A065371 we have a sequence starting with 14896 1's followed by 6, so a(10)= 14897.
|
|
|
CROSSREFS
|
Cf. A065371, A065372, A065373.
Sequence in context: A163251 A247177 A146286 * A130066 A206258 A270106
Adjacent sequences: A065371 A065372 A065373 * A065375 A065376 A065377
|
|
|
KEYWORD
|
more,nonn
|
|
|
AUTHOR
|
Reinhard Zumkeller, Nov 02 2001
|
|
|
EXTENSIONS
|
a(14)-a(16) from Paul Tek, Jun 10 2013
|
|
|
STATUS
|
approved
|
| |
|
|
