login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A081320 Largest 3-smooth divisor of n-th Fibonacci number. 0
1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 144, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 288, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 432, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 576, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 144, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 864, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 144, 1, 1, 2, 3, 1, 8, 1, 3, 2, 1, 1, 1152, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Conjecture: for n>12 and n>0 modulo 12: a(n)=a(n-12) and a(12*k)=A065331(k)*144.

EXAMPLE

Fibonacci(36) = 14930352 = 2^4 * 3^3 * 17 * 19 * 107, therefore

a(36) = 2^4 * 3^3 = 432.

CROSSREFS

Cf. A003586, a(n)=A065331(A000045(n)).

Sequence in context: A097710 A171024 A109198 * A147865 A175314 A011152

Adjacent sequences:  A081317 A081318 A081319 * A081321 A081322 A081323

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 20 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 21:13 EST 2012. Contains 206085 sequences.