Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A115568
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A115568 Maximal Fibonacci exponent in prime factorization of n. +0
2
0, 1, 1, 1, 2, 1, 1, 1, 3, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 3, 2, 1, 3, 2, 1, 1, 1, 5, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 1, 3, 1, 3, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 1, 1, 1, 5, 1, 2, 2, 2 (list; graph; listen)
OFFSET

0,5

CROSSREFS

Sequence in context: A129713 A096669 A096591 this_sequence A072909 A095691 A067029

Adjacent sequences: A115565 A115566 A115567 this_sequence A115569 A115570 A115571

KEYWORD

easy,nonn

AUTHOR

Giovanni Teofilatto (g.teofilatto(AT)tiscalinet.it), Mar 11 2006; revised Mar 13 2006

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 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research