|
Search: id:A005051
|
|
| |
|
| 8, 24, 72, 216, 648, 1944, 5832, 17496, 52488, 157464, 472392, 1417176, 4251528, 12754584, 38263752, 114791256, 344373768, 1033121304, 3099363912, 9298091736, 27894275208, 83682825624, 251048476872
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
For n>=3, a(n-3) is equal to the number of functions f:{1,2,...,n}->{1,2,3} such that for fixed, different x_1, x_2, x_3 in {1,2,...,n} and fixed y_1, y_2, y_3 in {1,2,3} we have f(x_i)<>y_i, (i=1,2,3). - Milan R. Janjic (agnus(AT)blic.net), May 13 2007
|
|
LINKS
|
Index entries for sequences related to linear recurrences with constant coefficients
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
Tanya Khovanova, Recursive Sequences
|
|
MAPLE
|
with(finance):seq(futurevalue(8, 2, n), n=0..22); # [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 25 2009]
|
|
CROSSREFS
|
Sequence in context: A066497 A111071 A090336 this_sequence A083583 A078158 A116486
Adjacent sequences: A005048 A005049 A005050 this_sequence A005052 A005053 A005054
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com).
|
|
|
Search completed in 0.002 seconds
|
