Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007585
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007585 10-gonal (or decagonal) pyramidal numbers: n(n+1)(8n-5)/6.
(Formerly M4791)
+0
7
0, 1, 11, 38, 90, 175, 301, 476, 708, 1005, 1375, 1826, 2366, 3003, 3745, 4600, 5576, 6681, 7923, 9310, 10850, 12551, 14421, 16468, 18700, 21125, 23751, 26586, 29638, 32915, 36425, 40176, 44176, 48433, 52955, 57750 (list; graph; listen)
OFFSET

0,3

COMMENT

Binomial transform of [1, 10, 17, 8, 0, 0, 0,...] = (1, 11, 38, 90,...). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), Mar 18 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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

FORMULA

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

CROSSREFS

Cf. A001107.

Cf. A093565 ((8, 1) Pascal, column m=3). Partial sums of A001107.

Sequence in context: A139276 A010002 A143109 this_sequence A024202 A133258 A103738

Adjacent sequences: A007582 A007583 A007584 this_sequence A007586 A007587 A007588

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), 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 December 16 13:01 EST 2009. Contains 170825 sequences.


AT&T Labs Research