Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024370
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024370 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = A023532, t = (composite numbers). +0
1
4, 6, 8, 9, 18, 21, 33, 37, 42, 47, 63, 69, 89, 96, 117, 126, 135, 142, 168, 178, 207, 217, 248, 259, 294, 307, 319, 332, 370, 385, 427, 443, 484, 503, 550, 568, 617, 636, 656, 675, 726, 747, 803, 825, 882, 906, 965, 991, 1054, 1079, 1144, 1172, 1201, 1230, 1298, 1324 (list; graph; listen)
page 1

Search completed in 0.001 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 2 11:54 EST 2009. Contains 167921 sequences.


AT&T Labs Research