Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024467
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024467 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 = A014306. +0
1
0, 1, 2, 1, 3, 2, 4, 7, 12, 11, 19, 18, 30, 28, 46, 41, 67, 54, 88, 142, 231, 230, 373, 371, 601, 596, 965, 952, 1541, 1507, 2439, 2350, 3803, 3570, 5776, 5166, 8359, 6761, 10940, 17702, 28643, 28635, 46333, 46312, 74935, 74880, 121159, 121015, 195807, 195430, 316213 (list; graph; listen)
OFFSET

1,3

CROSSREFS

Sequence in context: A026272 A022447 A117194 this_sequence A117364 A120250 A116529

Adjacent sequences: A024464 A024465 A024466 this_sequence A024468 A024469 A024470

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 17 23:40 EST 2009. Contains 171025 sequences.


AT&T Labs Research