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.

A126639 a(n) is the number of integers k less than 10^n such that the decimal representation of k lacks the digit 1,2,3, at least one of digits 4,5,6 and at least one of digits 7,8,9.

Original entry on oeis.org

7, 49, 331, 2137, 13147, 77449, 440251, 2432857, 13151707, 69895849, 366600571, 1903222777, 9802234267, 50171448649, 255545887291, 1296626911897, 6559153748827, 33101134543849, 166731005404411, 838567970940217, 4212526479343387, 21141483461069449
Offset: 1

Views

Author

Aleksandar M. Janjic and Milan Janjic, Feb 08 2007

Keywords

Crossrefs

Programs

  • Maple
    f:=n->9*5^n-18*4^n+15*3^n-6*2^n+1;
  • Mathematica
    LinearRecurrence[{15,-85,225,-274,120},{7,49,331,2137,13147},30] (* Harvey P. Dale, Aug 12 2015 *)
  • PARI
    Vec(-x*(120*x^4-238*x^3+191*x^2-56*x+7) / ((x-1)*(2*x-1)*(3*x-1)*(4*x-1)*(5*x-1)) + O(x^100)) \\ Colin Barker, Feb 22 2015

Formula

a(n) = 9*5^n-18*4^n+15*3^n-6*2^n+1.
G.f.: -x*(120*x^4-238*x^3+191*x^2-56*x+7) / ((x-1)*(2*x-1)*(3*x-1)*(4*x-1)*(5*x-1)). - Colin Barker, Feb 22 2015