|
Search: id:A050407
|
|
| |
|
| 0, 1, 1, 1, 2, 5, 11, 21, 36, 57, 85, 121, 166, 221, 287, 365, 456, 561, 681, 817, 970, 1141, 1331, 1541, 1772, 2025, 2301, 2601, 2926, 3277, 3655, 4061, 4496, 4961, 5457, 5985, 6546, 7141, 7771, 8437, 9140, 9881, 10661, 11481, 12342, 13245, 14191
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
Number of invertible shuffles of n-2 cards. - Adam C. McDougall (mcdougal(AT)stolaf.edu) and David Molnar )molnar(AT)stolaf.edu), Apr 09, 2002
If Y is a 3-subset of an n-set X then, for n>=3, a(n-2) is the number of (n-3)-subsets of X which have neither one element nor two elements in common with Y. - Milan R. Janjic (agnus(AT)blic.net), Dec 28 2007
|
|
REFERENCES
|
R. DiSario, Problem 10931, Amer. Math. Monthly, 109 (No. 3, 2002), 298.
|
|
FORMULA
|
Diagonal sums of square array A086460 (starting 1, 1, 2, ...). a(n+2)=1+n(n+1)(n-1)/6=sum{k=0..n, 0^k+(n-k)k}. - Paul Barry (pbarry(AT)wit.ie), Jul 21 2003
binomial(n,3)+binomial(n,0), n>=-1. - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 24 2006
a(n)=C(n+3,n)+1,n>=-4 . - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 21 2008
|
|
MAPLE
|
[seq(binomial(n, 3)+binomial(n, 0), n=-1..46)]; - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 24 2006
|
|
MATHEMATICA
|
a[n_]:=n*(n^2-6*n+11)/6; ...and/or...a=1; lst={0, 1, 1, a}; k=1; e=1; Do[a+=k; AppendTo[lst, a]; e++; k+=e, {n, 0, 5!}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Dec 17 2008]
|
|
CROSSREFS
|
Apart from initial terms, one more than the tetrahedral numbers A000292.
Sequence in context: A022908 A026390 A005575 this_sequence A113032 A100134 A137356
Adjacent sequences: A050404 A050405 A050406 this_sequence A050408 A050409 A050410
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Dec 22 1999
|
|
|
Search completed in 0.002 seconds
|
