cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A247715 Odd numbers n containing 16384 as the highest power of 2 in the Collatz (3x+1) iteration.

Original entry on oeis.org

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
Offset: 1

Views

Author

Derek Orr, Sep 22 2014

Keywords

Comments

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

Crossrefs

Programs

  • 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++)