Search: a329678 -id:a329678
|
|
A130543
|
|
Multiplicative persistence of n!.
|
|
+10
2
|
|
|
0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
From 5! on all the factorials end with "zero" thus the persistence is equal to 1.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: x^4/(1-x).
a(n) = 1 for n >= 4.
|
|
EXAMPLE
|
0!=1; 1!=1; 2!=2; 3!=6 --> Persistence=0
4!=24 --> 2*4=8 --> Persistence=1
5!=120 --> 1*2*0=0 --> Persistence=1
|
|
MAPLE
|
P:=proc(n)local i, k, w, ok, cont; for i from 0 by 1 to n do w:=1; k:=i!; ok:=1; if k<10 then print(0); else cont:=1; while ok=1 do while k>0 do w:=w*(k-(trunc(k/10)*10)); k:=trunc(k/10); od; if w<10 then ok:=0; print(cont); else cont:=cont+1; k:=w; w:=1; fi; od; fi; od; end: P(100);
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,base,nonn
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A329677
|
|
Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UH, HD, and DH.
|
|
+10
2
|
|
|
1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0
|
|
COMMENTS
|
The Motzkin step set is U=(1,1), H=(1,0) and D=(1,-1). An excursion is a path starting at (0,0), ending on the x-axis and never crossing the x-axis, i.e., staying at nonnegative altitude.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 1 + t + t^3 + t^4.
|
|
EXAMPLE
|
We only have the following four excursions of this type: the empty walk, H, UHD and UHDH.
|
|
MATHEMATICA
|
PadRight[#, 105] &@ CoefficientList[Series[1 + x + x^3 + x^4, {x, 0, 105}], x] (* Michael De Vlieger, Dec 16 2019 *)
|
|
CROSSREFS
|
Cf. A329670, A329678, A329679 (other Motzkin excursions avoiding certain consecutive steps such that the sequence counting them has growth rate zero).
|
|
KEYWORD
|
nonn,walk,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|
|
A329679
|
|
Number of excursions of length n with Motzkin-steps consisting only of consecutive steps UH, UD, HD and DH.
|
|
+10
2
|
|
|
1, 1, 1, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,4
|
|
COMMENTS
|
The Motzkin step set is U=(1,1), H=(1,0) and D=(1,-1). An excursion is a path starting at (0,0), ending on the x-axis and never crossing the x-axis, i.e., staying at nonnegative altitude.
|
|
LINKS
|
|
|
FORMULA
|
G.f.: 1 + t + t^2 + 2t^3 + t^4.
|
|
EXAMPLE
|
We only have the following six excursions of this type: the empty walk, H, UD, UDH, UHD and UHDH.
|
|
CROSSREFS
|
Cf. A329670, A329677, A329678 (other Motzkin excursions avoiding certain consecutive steps such that the sequence counting them has growth rate zero).
|
|
KEYWORD
|
nonn,walk,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
Search completed in 0.007 seconds
|