login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007188 Multiplicative encoding of Pascal triangle: Product p(i+1)^C(n,i).
(Formerly M1722)
15
2, 6, 90, 47250, 66852843750, 2806877704512541816406250, 1216935896582703898519354781702537118597533386230468750 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
COMMENTS
n-th power of x+1 using the encoding of polynomials defined in A206284 and A297845. - Peter Munn, Jul 20 2022
REFERENCES
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 828.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
N. J. A. Sloane, An on-line version of the Encyclopedia of Integer Sequences, Electronic J. Combinatorics, Vol. 1, no. 1, 1994.
FORMULA
a(0) = 2; for n > 0, a(n) = A297845(a(n-1), 6). - Peter Munn, Jul 20 2022
MATHEMATICA
c[n_] := CoefficientList[(1 + x)^n, x]; f[n_] := Product[Prime[k]^c[n][[k]], {k, 1, Length[c[n]]}]; Table[f[n], {n, 1, 7}] (* Clark Kimberling, Feb 05 2012 *)
CROSSREFS
Leftmost column of square array A066117.
Sequence in context: A177861 A218151 A343021 * A206156 A229052 A363838
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 19 18:05 EDT 2024. Contains 371798 sequences. (Running on oeis4.)