login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A025103 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n-k+1), where k = [ n/2 ], s = (composite numbers), t = (F(2), F(3), F(4), ...). 0
8, 12, 38, 62, 140, 226, 438, 709, 1277, 2066, 3595, 5817, 9888, 15999, 26712, 43221, 71357, 115458, 189407, 306467, 500534, 809881, 1318332, 2133106, 3464858, 5606258, 9094804 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..27.

CROSSREFS

Sequence in context: A341781 A282943 A024604 * A307652 A281663 A092179

Adjacent sequences: A025100 A025101 A025102 * A025104 A025105 A025106

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 28 03:39 EST 2022. Contains 358406 sequences. (Running on oeis4.)