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.

Showing 1-1 of 1 results.

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

Original entry on oeis.org

6, 76, 776, 7776, 67776, 667776, 6667776, 66667776, 766667776, 6766667776, 66766667776, 666766667776, 7666766667776, 77666766667776, 777666766667776, 7777666766667776, 77777666766667776, 777777666766667776
Offset: 1

Views

Author

Henry Bottomley, Mar 06 2000

Keywords

Crossrefs

Programs

  • Mathematica
    Table[Select[FromDigits/@Tuples[{6,7},n],Divisible[#,2^IntegerLength[ #]]&], {n,18}]//Flatten (* Harvey P. Dale, Jul 10 2016 *)

Formula

a(n)=a(n-1)+10^(n-1)*(6+[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 7.
Showing 1-1 of 1 results.