Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023856
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023856 a(n) = s(1)t(n)+s(2)t(n-1)+...+s(k)t(n+1-k), where k=[ (n+1)/2 ], s = (natural numbers), t = (natural numbers >= 2). +0
3
2, 3, 10, 13, 28, 34, 60, 70, 110, 125, 182, 203, 280, 308, 408, 444, 570, 615, 770, 825, 1012, 1078, 1300, 1378, 1638, 1729, 2030, 2135, 2480, 2600, 2992, 3128, 3570, 3723, 4218, 4389, 4940, 5130, 5740, 5950, 6622, 6853, 7590, 7843, 8648, 8924, 9800, 10100, 11050, 11375 (list; graph; listen)
OFFSET

1,1

COMMENT

Or, a(n) = s(1)s(n) + s(2)s(n-1) + ... + s(k)s(n-k+1), where k = [ n/2 ] and s = (natural numbers).

FORMULA

a(n) = (n+2)*[4n^2+13n+6-3(n+2)(-1)^n]/48.

a(n)=sum{k=1..[2*n+1+(-1)^(n+1)]/4, (n-k+1)(k-1)} with n>=3 - Paolo P. Lava (ppl(AT)spl.at), Jan 31 2007

CROSSREFS

Sequence in context: A066089 A004688 A024852 this_sequence A129315 A075770 A135101

Adjacent sequences: A023853 A023854 A023855 this_sequence A023857 A023858 A023859

KEYWORD

nonn

AUTHOR

Clark Kimberling (ck6(AT)evansville.edu)

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 September 5 19:27 EDT 2008. Contains 143485 sequences.


AT&T Labs Research