|
|
A041181
|
|
Denominators of continued fraction convergents to sqrt(101).
|
|
9
|
|
|
1, 20, 401, 8040, 161201, 3232060, 64802401, 1299280080, 26050404001, 522307360100, 10472197606001, 209966259480120, 4209797387208401, 84405914003648140, 1692328077460171201, 33930967463207072160, 680311677341601614401
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
a(n) equals the number of words of length n on alphabet {0,1,...,20} avoiding runs of zeros of odd lengths. - Milan Janjic, Jan 28 2015
Also called the 20-metallonacci sequence; the g.f. 1/(1-k*x-x^2) gives the k-metallonacci sequence.
a(n) is the number of tilings of an n-board (a board with dimensions n X 1) using unit squares and dominoes (with dimensions 2 X 1) if there are 20 kinds of squares available. (End)
|
|
LINKS
|
|
|
FORMULA
|
a(n) = F(n, 20), the n-th Fibonacci polynomial evaluated at x=20. - T. D. Noe, Jan 19 2006
a(n) = 20*a(n-1)+a(n-2) for n>1, a(0)=1, a(1)=20. G.f.: 1/(1-20*x-x^2). - Philippe Deléham, Nov 21 2008
|
|
MATHEMATICA
|
LinearRecurrence[{20, 1}, {1, 20}, 20] (* Harvey P. Dale, Mar 17 2020 *)
|
|
PROG
|
(Magma) I:=[1, 20]; [n le 2 select I[n] else 20*Self(n-1)+Self(n-2): n in [1..30]]; // Vincenzo Librandi, Dec 12 2013
|
|
CROSSREFS
|
Cf. similar sequences listed in A243399.
|
|
KEYWORD
|
nonn,frac,easy,less
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|