Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A065374
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A065374
%S A065374 5,13,29,43,61,307,383,2689,9209,14897,83557,274679,598333
%N A065374 Smallest k such that f(f(...f(k))) > 1, where f(k) = A065371(k) is iterated 
               n times.
%e A065374 a(2) = 13 because A065372(13) = 3 and A065372(i) = 1 for i < 13.
%e A065374 After 10 iterations of A065371 we have a sequence starting with 14896 
               1's followed by 6, so a(10)= 14897.
%Y A065374 Cf. A065371, A065372, A065373.
%Y A065374 Sequence in context: A159351 A163251 A146286 this_sequence A130066 A095085 
               A093836
%Y A065374 Adjacent sequences: A065371 A065372 A065373 this_sequence A065375 A065376 
               A065377
%K A065374 more,nonn
%O A065374 1,1
%A A065374 Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 02 2001

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified December 17 13:29 EST 2009. Contains 170826 sequences.


AT&T Labs Research