|
Search: id:A053539
|
|
|
| A053539 |
|
A second order recursive sequence. |
|
+0
2
|
|
| 1, 16, 192, 2048, 20480, 196608, 1835008, 16777216, 150994944, 1342177280, 11811160064, 103079215104, 893353197568, 7696581394432, 65970697666560, 562949953421312, 4785074604081152, 40532396646334464, 342273571680157696
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
With a different offset, number of n-permutations of 9 objects: p, q, r, u, v, w, z, x, y with repetition allowed, containing exactly one u. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 28 2007
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pp. 194-196.
|
|
LINKS
|
F. Ellermann, Illustration of binomial transforms
|
|
FORMULA
|
a(n)=n8^(n-1)
|
|
EXAMPLE
|
a(n)=16a(n-1)-64a(n-2); a(0)=1; n>0.
|
|
MAPLE
|
seq(seq(binomial(i, j)*8^(i-1), j =i-1), i=1..19); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Dec 28 2007
|
|
PROGRAM
|
(Other) SAGE: [lucas_number2(n, 8, 0)*binomial(n, 1)/8for n in xrange(1, 20)] # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 12 2009]
|
|
CROSSREFS
|
Binomial transform of A027473.
A001787, A053464, A053469, A053540.
Sequence in context: A036735 A071081 A000767 this_sequence A120994 A016178 A081202
Adjacent sequences: A053536 A053537 A053538 this_sequence A053540 A053541 A053542
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, Jan 15 2000
|
|
|
Search completed in 0.005 seconds
|
