|
Search: id:A099762
|
|
| |
|
| 0, 8, 108, 576, 2000, 5400, 12348, 25088, 46656, 81000, 133100, 209088, 316368, 463736, 661500, 921600, 1257728, 1685448, 2222316, 2888000, 3704400, 4695768, 5888828, 7312896, 9000000, 10985000, 13305708, 16003008, 19120976, 22707000
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n) is equal to the number of functions f:{1,2,3,4,5}->{1,2,...,n+1} such that for fixed different x_1, x_2 in {1,2,3,4,5} and fixed y_1, y_2 in {1,2,...,n+1} we have f(x_1)<>y_1 and f(x_2)<>y_2. - Milan R. Janjic (agnus(AT)blic.net), Apr 17 2007
|
|
LINKS
|
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
|
|
MAPLE
|
a:=n->sum(sum(n^3, j=2..n), k=2..n): seq(a(n), n=1..30); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), May 09 2007
|
|
CROSSREFS
|
Adjacent sequences: A099759 A099760 A099761 this_sequence A099763 A099764 A099765
Sequence in context: A000845 A027013 A105261 this_sequence A119936 A048543 A120975
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Kari Lajunen (Kari.Lajunen(AT)Welho.com), Nov 11 2004
|
|
|
Search completed in 0.002 seconds
|
