|
|
A091823
|
|
a(n) = 2*n^2 + 3*n - 1.
|
|
19
|
|
|
4, 13, 26, 43, 64, 89, 118, 151, 188, 229, 274, 323, 376, 433, 494, 559, 628, 701, 778, 859, 944, 1033, 1126, 1223, 1324, 1429, 1538, 1651, 1768, 1889, 2014, 2143, 2276, 2413, 2554, 2699, 2848, 3001, 3158, 3319, 3484, 3653, 3826, 4003, 4184, 4369, 4558
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
a(n) is the position of the row in Pascal's triangle (A007318) in which three consecutive entries appear in the ratio n: n+1: n+2. (Even valid for n = 0 if you allow for a position of -1 to have value 0.) The solution is unique for each n.
The row numbers are given by A060626.
If Y and Z are a 2-blocks of a 2n-set X then, for n>=2, a(n-1) is the number of (2n-2)-subsets of X intersecting Y. - Milan Janjic, Nov 18 2007
|
|
LINKS
|
|
|
FORMULA
|
a(n) = n + 4*binomial(2+n, n), with offset 0. - Zerinvary Lajos, May 12 2006
|
|
EXAMPLE
|
Entries in the ratio 1:2:3 appear in row 14 of Pascal's triangle (A007318) starting at position 4 (1001, 2002, 3003). Entries in the ratio 2:3:4 appear in row 34 of Pascal's triangle starting at position 13 (927983760, 1391975640, 1855967520); and so on (row 62, pos. 26; row 98, pos. 43; ...).
|
|
MAPLE
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Perl) #!/usr/bin/perl $a = 1; while (1) { $k = $a*(2*$a + 3) - 1; print "$k, "; $a ++; }
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,easy,changed
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|