Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A135728
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A135728 Record indices of A135727(n) = max{ A001281^k(n);k=0,1,2,3... } (3x-1 problem). +0
3
0, 1, 3, 5, 9, 17, 33, 65, 129, 153, 321, 1425, 1601, 1889, 3393, 4097, 6929, 8193 (list; graph; listen)
OFFSET

1,3

COMMENT

This gives indices n for which A135727(n) is larger than all preceding values of that sequence. As in A135727(n), we include the fixed point 0 in the domain of A001281. Obviously, many but not all entries are of the form 2^k+1, and not all of such numbers are in the sequence (e.g. 257, 1025, 2049 are missing). Is there a simple way of characterizing the exceptions?

PROGRAM

(PARI) A135728(Nmax=10^4)=local(m=-1); for(n=0, Nmax, if(m+0<m=max(m, A135727(n)), print1(n", ")))

CROSSREFS

Cf. A001281, A037084, A039500-A039505, A135727-A135730. A006370, A006577.

Adjacent sequences: A135725 A135726 A135727 this_sequence A135729 A135730 A135731

Sequence in context: A000213 A074858 A074860 this_sequence A083318 A127904 A048578

KEYWORD

more,nonn

AUTHOR

M. F. Hasler (Maximilian.Hasler(AT)gmail.com), Nov 26 2007

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 May 17 13:36 EDT 2008. Contains 139908 sequences.


AT&T Labs Research