|
|
A170732
|
|
Expansion of g.f.: (1+x)/(1 - 12*x).
|
|
51
|
|
|
1, 13, 156, 1872, 22464, 269568, 3234816, 38817792, 465813504, 5589762048, 67077144576, 804925734912, 9659108818944, 115909305827328, 1390911669927936, 16690940039135232, 200291280469622784, 2403495365635473408, 28841944387625680896, 346103332651508170752
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
For n >= 1, a(n) equals the number of words of length n-1 on the alphabet {0,1,...,12} with no two adjacent letters identical. - Milan Janjic, Jan 31 2015
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
k:=13; seq(`if`(n=0, 1, k*(k-1)^(n-1)), n = 0..25); # G. C. Greubel, Sep 24 2019
|
|
MATHEMATICA
|
|
|
PROG
|
(Python) for i in range(1001):print(i, 13*12**(i-1) if i>0 else 1) # Kenny Lau, Aug 01 2017
(Magma) k:=13; [1] cat [k*(k-1)^(n-1): n in [1..25]]; // G. C. Greubel, Sep 24 2019
(Sage) k=13; [1]+[k*(k-1)^(n-1) for n in (1..25)] # G. C. Greubel, Sep 24 2019
(GAP) k:=13;; Concatenation([1], List([1..25], n-> k*(k-1)^(n-1) )); # G. C. Greubel, Sep 24 2019
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|