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.

A226478 A085192(n)/2.

Original entry on oeis.org

1, 4, 1, 15, 1, 3, 1, 2, 57, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 221, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 29, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 13, 1, 3, 1, 2, 5, 1, 2, 4, 9, 1, 2, 4, 8, 869, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 29, 1, 3, 1, 2, 9, 1, 3, 1, 2, 5, 1, 2, 4, 13, 1, 3, 1, 2, 5, 1, 2, 4, 9, 1, 2, 4, 8, 101
Offset: 1

Views

Author

Ralf Stephan, Aug 31 2013

Keywords

Comments

The records are 1,4,15,57,221,869,3445,13717,54741... (apparently 1/24*(5*4^n+6*2^n-8)) and they occur at index 1,2,4,9,23,65,197,626,2056.. (Is this A014137?).

Crossrefs

Cf. A014486.

Programs

  • PARI
    isA014486(n)=my(v=binary(n), t=0); for(i=1, #v, t+=if(v[i], 1, -1); if(t<0, return(0))); t==0
    L=listcreate();for(n=0,200000,if(isA014486(n),listput(L,n)));v=Vec(L);for(n=1,#v-1,print1((v[n+1]-v[n])/2,","))