Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A024595
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A024595
%S A024595 1,0,0,1,2,3,5,0,0,1,2,3,5,8,13,21,34,55,89,1,2,3,5,8,13,21,34,55,89,144,
%T A024595 233,377,610,987,1598,2586,4184,6770,10954,13,21,34,55,89,144,233,377,
               610,
%U A024595 987,1597,2584,4181,6765,10946,17711,28658,46370,75028,121398,196426
%N A024595 a(n) = s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/
               2 ], s = (F(2), F(3), ...), t = A023533.
%Y A024595 Sequence in context: A038105 A143716 A107656 this_sequence A144804 A118308 
               A068909
%Y A024595 Adjacent sequences: A024592 A024593 A024594 this_sequence A024596 A024597 
               A024598
%K A024595 nonn
%O A024595 1,5
%A A024595 Clark Kimberling (ck6(AT)evansville.edu)

    
page 1

Search completed in 0.001 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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research