Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A025100
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A025100 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (1, p(1), p(2), ...), t = (composite numbers). +0
1
6, 8, 25, 28, 59, 68, 129, 148, 249, 277, 454, 491, 728, 790, 1131, 1225, 1650, 1759, 2313, 2436, 3173, 3338, 4197, 4414, 5495, 5732, 7003, 7304, 8737, 9108, 10767, 11219, 13172, 13718, 15997, 16588, 19089, 19714, 22566, 23296, 26463, 27301, 30722, 31686, 35514 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A053189 A156231 A024860 this_sequence A155478 A107366 A024873

Adjacent sequences: A025097 A025098 A025099 this_sequence A025101 A025102 A025103

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 November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research