Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024855
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024855 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (natural numbers), t = A023531. +0
1
1, 0, 0, 1, 2, 3, 4, 1, 2, 3, 4, 5, 7, 9, 11, 4, 5, 6, 8, 10, 12, 14, 16, 18, 20, 9, 11, 13, 15, 17, 19, 21, 23, 26, 29, 32, 35, 18, 20, 22, 24, 26, 29, 32, 35, 38, 41, 44, 47, 50, 53, 29, 32, 35, 38, 41, 44, 47, 50, 53, 56, 59, 62, 66, 70, 74, 78, 47, 50, 53, 56, 59, 62, 65, 68, 72, 76, 80 (list; graph; listen)
OFFSET

2,5

CROSSREFS

Sequence in context: A053824 A033925 A064866 this_sequence A074057 A163258 A141063

Adjacent sequences: A024852 A024853 A024854 this_sequence A024856 A024857 A024858

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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research