Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060319
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060319 Smallest Fibonacci number with n distinct prime factors. +0
5
1, 2, 21, 610, 6765, 832040, 102334155, 190392490709135, 1548008755920, 23416728348467685, 2880067194370816120, 81055900096023504197206408605, 2706074082469569338358691163510069157, 5358359254990966640871840, 57602132235424755886206198685365216, 18547707689471986212190138521399707760 (list; graph; listen)
OFFSET

0,2

LINKS

R. Knott, Fibonacci numbers with tables of F(0)-F(500)

EXAMPLE

a(5)=F(30)=832040=8.5.11.41.61

MATHEMATICA

f[n_]:=Length@FactorInteger[Fibonacci[n]]; lst={}; Do[Do[If[f[n]==q, Print[Fibonacci[n]]; AppendTo[lst, Fibonacci[n]]; Break[]], {n, 280}], {q, 18}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 23 2009]

CROSSREFS

Cf. A001605, A005478, A060320.

Sequence in context: A158886 A092957 A078602 this_sequence A095224 A034984 A024233

Adjacent sequences: A060316 A060317 A060318 this_sequence A060320 A060321 A060322

KEYWORD

nonn,new

AUTHOR

Labos E. (labos(AT)ana.sote.hu), Mar 28 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 November 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research