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.

A071623 Least k such that n = A071532(k).

Original entry on oeis.org

1, 4, 5, 6, 7, 8, 15, 18, 21, 22, 35, 64, 65, 130, 131, 160, 161, 170, 175, 186, 187, 190, 391, 392, 393, 508, 511, 514, 515, 516, 519, 530, 535, 536, 539, 540, 543, 552, 553, 566, 577, 584, 587, 588, 593, 594, 627, 630, 631, 636
Offset: 1

Views

Author

Benoit Cloitre, Jun 22 2002

Keywords

Comments

For some n, a(n+1)-a(n)=1.

Crossrefs

Cf. A071532.

Programs

  • PARI
    for(n=1,50,s=1; while(abs(n+sum(i=1,s,sign((-1)^floor((3/2)^i))))>0,s++); print1(s,","))