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.

A053379 a(n) contains n digits (either '7' or '8') and is divisible by 2^n.

Original entry on oeis.org

8, 88, 888, 7888, 77888, 877888, 7877888, 87877888, 787877888, 8787877888, 88787877888, 888787877888, 8888787877888, 88888787877888, 788888787877888, 8788888787877888, 88788888787877888, 888788888787877888
Offset: 1

Views

Author

Henry Bottomley, Mar 06 2000

Keywords

Crossrefs

Formula

a(n)=a(n-1)+10^(n-1)*(8-[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with an 8, if not then n-th term begins with a 7.