login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A109409 Coefficients of polynomials triangular sequence produced by removing primes from the odd numbers in A028338. 0
1, 1, 1, 0, 1, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 9, 10, 1, 0, 0, 0, 0, 9, 10, 1, 0, 0, 0, 0, 0, 9, 10, 1, 0, 0, 0, 0, 0, 135, 159, 25, 1, 0, 0, 0, 0, 0, 0, 135, 159, 25, 1, 0, 0, 0, 0, 0, 0, 0, 135, 159, 25, 1, 0, 0, 0, 0, 0, 0, 0, 2835, 3474, 684, 46, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,19

COMMENTS

The row sums also appear to be new: b = Flatten[Join[{{1}}, Table[Apply[Plus, Abs[CoefficientList[Product[x + g[n], {n, 0, m}], x]]], {m, 0, 10}]]] {1, 2, 2, 2, 2, 20, 20, 20, 320, 320, 320, 7040} Since the row sum of A028338 is the double factorial A000165: this result seems to be a factorization of the double factorial numbers by relatively sparse nonprime odd numbers. It might be better to reverse the order of the coefficients to get the higher powers first.

LINKS

Table of n, a(n) for n=1..78.

FORMULA

p[n]=Product[If[PrimeQ[2*n+1]==false,x+(2*n+1),x] a(n) =CoefficientList[p[n],x]

EXAMPLE

{1},

{1, 1},

{0, 1, 1},

{0, 0, 1, 1},

{0, 0, 0, 1, 1},

{0, 0, 0, 9, 10, 1},

{0, 0, 0, 0, 9, 10, 1},

{0, 0, 0, 0, 0, 9, 10, 1}

MATHEMATICA

a = Join[{{1}}, Table[CoefficientList[Product[x + g[n], {n, 0, m}], x], {m, 0, 10}]]; Flatten[a]

CROSSREFS

Cf. A028338, A000165, A039757.

Sequence in context: A220450 A318147 A324663 * A262551 A160563 A158286

Adjacent sequences:  A109406 A109407 A109408 * A109410 A109411 A109412

KEYWORD

nonn,uned

AUTHOR

Roger L. Bagula, May 19 2007

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 14 09:25 EDT 2019. Contains 327995 sequences. (Running on oeis4.)