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.

A053335 a(n) contains n digits (either '3' or '6') and is divisible by 2^n.

Original entry on oeis.org

6, 36, 336, 6336, 66336, 366336, 6366336, 36366336, 636366336, 3636366336, 33636366336, 333636366336, 3333636366336, 33333636366336, 633333636366336, 3633333636366336, 33633333636366336, 333633333636366336
Offset: 1

Views

Author

Henry Bottomley, Mar 06 2000

Keywords

Crossrefs

Formula

a(n)=a(n-1)+10^(n-1)*(6-3*[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 a 6, if not then n-th term begins with a 3.