Greetings from
The On-Line Encyclopedia of Integer Sequences
!
Hints
Search:
id:A049996
Displaying 1-1 of 1 results found.
page 1
Format:
long
| short |
internal
|
text
Sort: relevance |
references
|
number
Highlight: on |
off
A049996
a(n)=index k such that F(k)=d(n), where d=
A049874
(difference sequence of ordered products of Fibonacci numbers).
+0
1
1, 1, 1, 3, 1, 3, 3, 4, 3, 1, 5, 4, 3, 6, 5, 1, 3, 7, 6, 3, 4, 8, 7, 3, 1, 5, 9, 8, 4, 3, 6, 10, 9, 5, 1, 3, 7, 11, 10, 6, 3, 4, 8, 12, 11, 7, 3, 1, 5, 9
(
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 4 08:07 EST 2009. Contains 170310 sequences.
AT&T Labs Research
Legal Notice
© 2009 AT&T Intellectual Property.
All Rights Reserved.
