|
Search: id:A006325
|
|
|
| A006325 |
|
4-dimensional analogue of centered polygonal numbers. |
|
+0
12
|
|
| 0, 0, 1, 7, 26, 70, 155, 301, 532, 876, 1365, 2035, 2926, 4082, 5551, 7385, 9640, 12376, 15657, 19551, 24130, 29470, 35651, 42757, 50876, 60100, 70525, 82251, 95382, 110026, 126295, 144305, 164176, 186032, 210001, 236215, 264810, 295926
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
COMMENT
|
If X is an n-set and Y and Z disjoint 2-subsets of X then a(n-4) is equal to the number of 6-subests of X intersecting both Y and Z. - Milan R. Janjic (agnus(AT)blic.net), Aug 26 2007
|
|
REFERENCES
|
T. A. Gulliver, Sequences from Arrays of Integers, Int. Math. Journal, Vol. 1, No. 4, pp. 323-332, 2002.
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
|
|
FORMULA
|
a(n) = n*(n-1)*(n^2-n+1)/6.
a(n) = [(n^5-(n-1)^5)-(n^1-(n-1)^1)]/30 = (n^5-(n-1)^5-1)/30. - Xavier Acloque Jan 25 2003
This sequence is, with different offset, the partial sums of the octahedral numbers. a(n+1) = SUM[i=0..n] A005900(i). a(n+1) = SUM[i=0..n] OctahedralNumber(i). a(n+1) = SUM[i=0..n] (2n^3 + n)/3. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Mar 14 2006
|
|
CROSSREFS
|
Sequence in context: A135300 A024001 A068601 this_sequence A053346 A027964 A078501
Adjacent sequences: A006322 A006323 A006324 this_sequence A006326 A006327 A006328
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
Albert Rich (Albert_Rich(AT)msn.com)
|
|
|
Search completed in 0.002 seconds
|
