Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007587
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007587 12-gonal (or dodecagonal) pyramidal numbers: n(n+1)(10n-7)/6.
(Formerly M4895)
+0
4
0, 1, 13, 46, 110, 215, 371, 588, 876, 1245, 1705, 2266, 2938, 3731, 4655, 5720, 6936, 8313, 9861, 11590, 13510, 15631, 17963, 20516, 23300, 26325, 29601, 33138, 36946, 41035, 45415, 50096, 55088, 60401, 66045 (list; graph; listen)
OFFSET

0,3

REFERENCES

A. H. Beiler, Recreations in the Theory of Numbers, Dover, NY, 1964, p. 194.

FORMULA

a(n)=(10*n-7)*binomial(n+1, 2)/3. G.f.: x*(1+9*x)/(1-x)^4.

Binomial transform of [1, 12, 21, 10, 0, 0, 0,...] = (1, 13, 46, 110,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Nov 28 2007

CROSSREFS

Cf. A093645 ((10, 1) Pascal, column m=3). Partial sums of A051624.

Adjacent sequences: A007584 A007585 A007586 this_sequence A007588 A007589 A007590

Sequence in context: A141549 A121964 A010003 this_sequence A034462 A116476 A035340

KEYWORD

nonn,easy,nice

AUTHOR

njas, R. K. Guy.

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified October 7 08:31 EDT 2008. Contains 144667 sequences.


AT&T Labs Research