Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024468
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024468 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (Fibonacci numbers), t = (primes). +0
2
2, 3, 8, 12, 28, 38, 73, 95, 170, 206, 352, 426, 715, 827, 1368, 1602, 2630, 3028, 4943, 5461, 8882, 9958, 16164, 17590, 28523, 30757, 49830, 54464, 88192, 96380, 156029, 167899, 271754, 287336, 465016, 497462, 805011, 849381, 1374432, 1446820, 2341116 (list; graph; listen)
OFFSET

1,1

CROSSREFS

Sequence in context: A115449 A079980 A025080 this_sequence A134683 A067853 A086590

Adjacent sequences: A024465 A024466 A024467 this_sequence A024469 A024470 A024471

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 13 23:45 EST 2009. Contains 170824 sequences.


AT&T Labs Research