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.

User: James Spahlinger

James Spahlinger's wiki page.

James Spahlinger has authored 1 sequences.

A217871 a(n)=b(n,1) where b(0,m)=m, b(n,m)=b(floor(n/4),m*2).

Original entry on oeis.org

1, 2, 2, 2, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16
Offset: 0

Views

Author

James Spahlinger, Oct 13 2012

Keywords

Comments

Part of the Newton integer square-root finding process. Establishes the upper bound a(n) >= A000196(n) for all n >= 0.

Crossrefs

Cf. A000196

Formula

a(n)=b(n,1) where b(0,m)=m; b(n,m)=b(floor(n/4),m*2).
a(n)=2^ceiling(A029837(n+1)/2).

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.