Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A024367
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A024367
s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s =
A023532
, t = (Fibonacci numbers).
+0
1
1, 1, 2, 3, 7, 11, 21, 34, 55, 89, 152, 246, 411, 665, 1097, 1775, 2872, 4647, 7574, 12255, 19918, 32228, 52290, 84607, 137130, 221881, 359011, 580892, 940513, 1521782, 2463282, 3985674, 6450553
(
list
;
graph
;
listen
)
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 10 00:48 EST 2009. Contains 170565 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
