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.

A053313 a(n) contains n digits (either '2' or '9') and is divisible by 2^n.

Original entry on oeis.org

2, 92, 992, 2992, 92992, 292992, 2292992, 22292992, 222292992, 2222292992, 22222292992, 922222292992, 9922222292992, 29922222292992, 929922222292992, 9929922222292992, 99929922222292992, 999929922222292992
Offset: 1

Views

Author

Henry Bottomley, Mar 06 2000

Keywords

Crossrefs

Programs

  • Mathematica
    Select[Flatten[Table[FromDigits/@Tuples[{2,9},n],{n,18}]],Divisible[ #,2^IntegerLength[ #]]&] (* Harvey P. Dale, Feb 07 2015 *)

Formula

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