Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A081320
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A081320 Largest 3-smooth divisor of n-th Fibonacci number. +0
1
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; listen)
OFFSET

1,3

COMMENT

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: A104027 A097710 A109198 this_sequence A147865 A011152 A078298

Adjacent sequences: A081317 A081318 A081319 this_sequence A081321 A081322 A081323

KEYWORD

nonn

AUTHOR

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

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 7 08:40 EST 2009. Contains 170430 sequences.


AT&T Labs Research