|
|
A104891
|
|
a(0) = 0; a(n) = 5*a(n-1) + 5.
|
|
3
|
|
|
0, 5, 30, 155, 780, 3905, 19530, 97655, 488280, 2441405, 12207030, 61035155, 305175780, 1525878905, 7629394530, 38146972655, 190734863280, 953674316405, 4768371582030, 23841857910155, 119209289550780, 596046447753905, 2980232238769530, 14901161193847655
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
Number of integers from 0 to (10^n)-1 that lack 0, 1, 2, 3 and 4 as a digit.
Number of monic irreducible polynomials of degree 1 in GF(5)[x1,...,xn]. - Max Alekseyev, Jan 23 2006
|
|
LINKS
|
|
|
FORMULA
|
a(n) = 6*a(n-1) - 5*a(n-2).
G.f.: 5*x / ((1-x)*(1-5*x)). (End)
|
|
EXAMPLE
|
a(3) = 5*a(2) + 5 = 5*30 + 5 = 155.
|
|
MAPLE
|
|
|
MATHEMATICA
|
RecurrenceTable[{a[n]==5*a[n-1]+5, a[0]==0}, a, {n, 0, 30}] (* Vaclav Kotesovec, Jul 25 2014 *)
|
|
PROG
|
(PARI) concat(0, Vec(5*x/((x-1)*(5*x-1)) + O(x^30))) \\ Colin Barker, Jul 25 2014
(Magma) [5*(5^n -1)/4: n in [0..30]]; // G. C. Greubel, Jun 15 2021
(Sage) [5*(5^n -1)/4 for n in (0..30)] # G. C. Greubel, Jun 15 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|