|
Search: id:A119724
|
|
|
| A119724 |
|
Generalized Pascal's triangle made using Mod[(Prime[n] - 1)/2, 4] == 2 primorial-like Stirling polynomials. |
|
+0
2
|
|
| 1, 1, -1, 1, -2, 1, 1, -3, 3, -1, 1, -4, 6, -4, 1, 1, -5, 10, -10, 5, -1, 1, -10, 35, -60, 55, -26, 5, 1, -15, 85, -235, 355, -301, 135, -25, 1, -20, 160, -660, 1530, -2076, 1640, -700, 125, 1, -25, 260, -1460, 4830, -9726, 12020, -8900, 3625, -625, 1, -30, 385, -2760, 12130, -33876, 60650, -69000, 48125, -18750
(list; graph; listen)
|
|
|
OFFSET
|
0,5
|
|
|
COMMENT
|
First row that isn't Pascal: {1, -10, 35, -60, 55, -26, 5} Of the four Mod[(Prime[n] - 1)/2, 4] types, this is the least Pascal-like.
|
|
FORMULA
|
a(n) = Flatten[Join[{{1}}, Table[Reverse[CoefficientList[Product[x - p1[n], {n, 0, m}], x]], {m, 0, 10}]]]
|
|
MATHEMATICA
|
a = Join[{{1}}, Table[Reverse[ CoefficientList[Product[x - p1[n], {n, 0, m}], x]], {m, 0, 10}]] aout = Flatten[a]
|
|
CROSSREFS
|
Cf. A007318, A118686.
Sequence in context: A130595 A108363 A076831 this_sequence A008571 A051137 A034328
Adjacent sequences: A119721 A119722 A119723 this_sequence A119725 A119726 A119727
|
|
KEYWORD
|
sign,uned,tabf,obsc
|
|
AUTHOR
|
Roger L. Bagula (rlbagulatftn(AT)yahoo.com) Jun 14 2006
|
|
EXTENSIONS
|
Should be edited in the same way that I edited A118686. Unfortunately p1 has not been defined, but must be related to "Mod[(Prime[n] - 1)/2, 4] == 2". Compare the definition of p[n] in A118686. - njas, Oct 08 2006
|
|
|
Search completed in 0.002 seconds
|
