login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A172145
Smallest Fibonacci numbers with Factor 3^n.
1
1, 3, 144, 14930352, 16641027750620563662096, 23041483585524168262220906489642018075101617466780496790573690289968, 61164766314391710035884829815943265224568052927769577329622759945237346639032672167677108820397521093126336764093707189513015791230614183821533954756601790054548991800671186110593262317807192235925106064
OFFSET
1,2
EXAMPLE
f(1) = 3^0 = 1,
f(4) = 3^1 = 3,
f(12) = 2^4*3^2 = 144,
f(36) = 2^4*3^3*17*19*107 = 14930352,
f(108) = 2^4*3^4*17*19*53*107*109*5779*11128427,
f(324) = 2^4*3^5*17*19*53*107*109*2269*..,
f(972) = 2^4*3^6*17*19*53*107*109*2269*..., ..
MATHEMATICA
lst={1}; k=4; Do[AppendTo[lst, Fibonacci[k]]; k*=3, {n, 7}]; lst
CROSSREFS
Cf. A000045.
Sequence in context: A278310 A195936 A323998 * A100931 A152180 A042135
KEYWORD
nonn
AUTHOR
STATUS
approved