Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024860
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024860 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 = (composite numbers). +0
1
6, 8, 25, 28, 59, 68, 119, 136, 211, 234, 338, 366, 502, 543, 715, 770, 981, 1042, 1297, 1365, 1667, 1752, 2104, 2208, 2615, 2726, 3191, 3325, 3854, 4013, 4610, 4797, 5466, 5682, 6426, 6654, 7477, 7716, 8620, 8889, 9878, 10181, 11261, 11600, 12774, 13150, 14422 (list; graph; listen)
OFFSET

2,1

CROSSREFS

Sequence in context: A119875 A053189 A156231 this_sequence A025100 A155478 A107366

Adjacent sequences: A024857 A024858 A024859 this_sequence A024861 A024862 A024863

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research