|
Search: id:A052905
|
|
|
| A052905 |
|
A simple regular expression. |
|
+0
8
|
|
| 1, 5, 10, 16, 23, 31, 40, 50, 61, 73, 86, 100, 115, 131, 148, 166, 185, 205, 226, 248, 271, 295, 320, 346, 373, 401, 430, 460, 491, 523, 556, 590, 625, 661, 698, 736, 775, 815, 856, 898, 941, 985, 1030, 1076, 1123, 1171, 1220, 1270, 1321, 1373, 1426, 1480
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
If Y_i (i=1,2,3,4,5) are 2-blocks of an n-set X then, for n>=10, a(n-4) is the number of (n-2)-subsets of X intersecting each Y_i (i=1,2,3,4,5). - Milan R. Janjic (agnus(AT)blic.net), Nov 09 2007
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 884
|
|
FORMULA
|
G.f.: (-2*x+2*x^2-1)/(-1+x)^3
Recurrence: {a(0)=1, a(1)=5, a(2)=10, -2*a(n)+n^2+7*n+2}
1/2*n^2+7/2*n+1
Starting 1, 5, 10, 16, 23,... gives binomial transform of (1, 4, 1, 0, 0, 0,...). A052905 = row sums of triangle A131899 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 25 2007
Row sums of triangle A134199 - Gary W. Adamson (qntmpkt(AT)yahoo.com), Oct 13 2007
|
|
MAPLE
|
spec := [S, {S=Prod(Sequence(Z), Sequence(Z), Union(Sequence(Z), Z, Z))}, unlabeled]: seq(combstruct[count](spec, size=n), n=0..20);
seq(binomial(n, 2)-5, n=4..55); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 13 2007
a:=n->sum((n-4)/2, j=0..n): seq(a(n)-2, n=5..56); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 30 2007
with (combinat):seq((fibonacci(3, n)+n-11)/2, n=3..54); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 07 2008
a:=n->sum(k, k=0..n):seq(a(n)/2+sum(k, k=5..n)/2, n=3..54); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jun 10 2008
|
|
CROSSREFS
|
Cf. A131899.
Cf. A134199.
Cf. A002522.
Sequence in context: A008057 A075003 A005280 this_sequence A026059 A115002 A054514
Adjacent sequences: A052902 A052903 A052904 this_sequence A052906 A052907 A052908
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Jun 08 2000
|
|
|
Search completed in 0.002 seconds
|
