Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006004
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006004 C(n+2,3)+C(n,3)+C(n-1,3).
(Formerly M3412)
+0
1
1, 4, 11, 25, 49, 86, 139, 211, 305, 424, 571, 749, 961, 1210, 1499, 1831, 2209, 2636, 3115, 3649, 4241, 4894, 5611, 6395, 7249, 8176, 9179, 10261, 11425, 12674, 14011, 15439, 16961, 18580, 20299, 22121 (list; graph; listen)
OFFSET

1,2

COMMENT

Equals binomial transform of [1, 3, 4, 3, 0, 0, 0,...]. Example: a(4) = 25 = (1, 3, 3, 1) dot (1, 3, 4, 3) = (1 + 9 + 12 + 3). - Gary W. Adamson (qntmpkt(AT)yahoo.com), Jul 25 2008

REFERENCES

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

S. M. Losanitsch, Die Isomerie-Arten bei den Homologen der Paraffin-Reihe, Chem. Ber. 30 (1897), 1917-1926.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

(n^3-2n^2+5n-2)/2.

CROSSREFS

Sequence in context: A115294 A110610 A051462 this_sequence A006522 A036837 A011851

Adjacent sequences: A006001 A006002 A006003 this_sequence A006005 A006006 A006007

KEYWORD

nonn,easy,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.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 December 1 13:27 EST 2009. Contains 167806 sequences.


AT&T Labs Research