Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060865
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060865 a(n) is the exact power of 2 that divides the n-th Fibonacci number (A000045). +0
3
1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 16, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 32, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 16, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 64, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 16, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 32, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 16, 1, 1, 2, 1, 1, 8, 1, 1, 2, 1, 1, 128, 1, 1, 2, 1 (list; graph; listen)
OFFSET

1,3

FORMULA

If n is not divisible by 3 then a(n) = 1, if n = 3 * 2^k * (2m + 1) then a(n) = 2 if k=0 or 2^(k+2) if k>0.

EXAMPLE

a(12) = 16 because the 12-th Fibonacci number is 144 and 144 = 9*16

CROSSREFS

A000045.

Sequence in context: A058955 A072286 A007375 this_sequence A078689 A134470 A119418

Adjacent sequences: A060862 A060863 A060864 this_sequence A060866 A060867 A060868

KEYWORD

nonn,easy

AUTHOR

Ahmed Fares (ahmedfares(AT)my-deja.com), May 04 2001

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), May 07 2001

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 September 6 00:03 EDT 2008. Contains 143485 sequences.


AT&T Labs Research