Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024466
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A024466 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 = A023533. +0
1
1, 0, 0, 1, 1, 2, 3, 0, 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 988, 1598, 2586, 4184, 6770, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17712, 28658, 46370, 75028, 121398, 196426 (list; graph; listen)
OFFSET

1,6

CROSSREFS

Sequence in context: A152857 A097946 A083926 this_sequence A021817 A069585 A167613

Adjacent sequences: A024463 A024464 A024465 this_sequence A024467 A024468 A024469

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research