Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025070
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025070 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = A023532, t = (composite numbers). +0
1
6, 8, 9, 10, 21, 24, 37, 42, 47, 51, 69, 75, 96, 102, 126, 135, 142, 150, 178, 187, 217, 227, 259, 272, 307, 319, 332, 345, 385, 401, 443, 457, 503, 522, 568, 587, 636, 656, 675, 693, 747, 769, 825, 847, 906, 929, 991, 1016, 1079, 1105, 1172, 1201, 1230, 1256, 1324, 1354 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Adjacent sequences: A025067 A025068 A025069 this_sequence A025071 A025072 A025073

Sequence in context: A102106 A074845 A001746 this_sequence A123704 A045574 A074284

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 May 16 23:01 EDT 2008. Contains 139884 sequences.


AT&T Labs Research