Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007518
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007518 [ n(n+2)(2n-1)/8 ].
(Formerly M2776)
+0
2
0, 3, 9, 21, 39, 66, 102, 150, 210, 285, 375, 483, 609, 756, 924, 1116, 1332, 1575, 1845, 2145, 2475, 2838, 3234, 3666, 4134, 4641, 5187, 5775, 6405, 7080, 7800, 8568, 9384, 10251, 11169, 12141, 13167, 14250, 15390 (list; graph; listen)
OFFSET

0,2

REFERENCES

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

From a problem on p. 151 of J. Rec. Math., 7 (1975).

FORMULA

3*A002623(n) for n>0. - M. F. Hasler, Sep 15 2009

G.f.:3*x/((x+1)*(x-1)^4) [From Maksym Voznyy (voznyy(AT)mail.ru), Aug 10 2009]

CROSSREFS

Column 4 of triangle A094953.

Sequence in context: A009864 A014857 A112039 this_sequence A029494 A059774 A064999

Adjacent sequences: A007515 A007516 A007517 this_sequence A007519 A007520 A007521

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Robert G. Wilson v (rgwv(AT)rgwv.com)

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 November 24 14:25 EST 2009. Contains 167438 sequences.


AT&T Labs Research