Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024480
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024480 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). +0
1
4, 6, 20, 25, 52, 59, 113, 129, 218, 249, 409, 454, 673, 728, 1045, 1131, 1529, 1650, 2173, 2313, 3016, 3173, 3989, 4197, 5228, 5495, 6716, 7003, 8379, 8737, 10330, 10767, 12650, 13172, 15370, 15997, 18418, 19089, 21858, 22566, 25639, 26463, 29783, 30722 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A057789 A123169 A023863 this_sequence A066193 A026711 A026788

Adjacent sequences: A024477 A024478 A024479 this_sequence A024481 A024482 A024483

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research