Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A049999
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A049999 a(n)=index k such that F(k)=d(n), where d=A049997 (difference sequence of ordered products of Fibonacci numbers). +0
1
1, 1, 1, 1, 1, 1, 3, 1, 1, 4, 3, 1, 5, 4, 1, 1, 6, 5, 1, 3, 7, 6, 1, 1, 4, 8, 7, 3, 1, 5, 9, 8, 4, 1, 1, 6, 10, 9, 5, 1, 3, 7, 11, 10, 6, 1, 1, 4, 8 (list; graph; listen)
OFFSET

1,7

CROSSREFS

Sequence in context: A134264 A125181 A157076 this_sequence A126015 A144336 A036040

Adjacent sequences: A049996 A049997 A049998 this_sequence A050000 A050001 A050002

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 1 19:22 EST 2009. Contains 167811 sequences.


AT&T Labs Research