login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A247715 Odd numbers n containing 16384 as the highest power of 2 in the Collatz (3x+1) iteration. 1
5461, 7281, 29125, 38833, 51777, 77667, 103555, 116501, 122731, 138073, 155333, 163641, 184097, 207109, 245463, 276145, 276147, 310669, 327283, 368193, 368195, 414221, 414225, 436377, 466005, 490925, 552291, 552293, 581835, 621333, 654565, 689583, 736387, 736389, 828437, 828451 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

a(n)*2^k also contains 16384 as the highest power of 2 for any k >= 0.

LINKS

Table of n, a(n) for n=1..36.

PROG

(PARI)

Max2(n)=v=[n]; while(n!=1, if(n==Mod(0, 2), n=n/2; v=concat(v, n)); if(n==Mod(1, 2)&&n!=1, n=3*n+1; v=concat(v, n))); k=1; while(vecsearch(vecsort(v), 2^k), k++); 2^(k-1)

n=1; while(n<10^4, if(n%2&&Max2(n)==16384, print1(n, ", ")); n++)

CROSSREFS

Cf. A008908, A010120.

Sequence in context: A251052 A259514 A217255 * A043580 A104111 A028548

Adjacent sequences:  A247712 A247713 A247714 * A247716 A247717 A247718

KEYWORD

nonn

AUTHOR

Derek Orr, Sep 22 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 23 16:18 EST 2020. Contains 338590 sequences. (Running on oeis4.)