login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072556 Numbers n such that n and the n-th Fibonacci number have the same number of distinct prime factors. 0
1, 3, 4, 5, 7, 10, 11, 12, 13, 14, 17, 22, 23, 26, 29, 34, 43, 47, 83, 94, 131, 137, 359, 431, 433, 449, 509, 569, 571 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(7)=10 because 10 and 10th Fibonacci number(i.e. 55) have the same number of prime factors i.e. 2. - Shyam Sunder Gupta, Feb 05 2006
MAPLE
with(combinat): with(numtheory): a:=proc(n) if nops(factorset(fibonacci(n)))=nops(factorset(n)) then n else fi end: seq(a(n), n=1..150); # Emeric Deutsch, Apr 02 2006
MATHEMATICA
Insert[Select[Range[1, 50], Length[FactorInteger[ # ]] ==Length[FactorInteger[Fibonacci[ # ]]] &], 2, 2] (* Stefan Steinerberger, Mar 20 2006 *)
Select[Range[600], PrimeNu[#]==PrimeNu[Fibonacci[#]]&] (* Harvey P. Dale, Oct 14 2023 *)
CROSSREFS
Sequence in context: A165713 A105148 A370862 * A047365 A353448 A048342
KEYWORD
more,nonn
AUTHOR
Benoit Cloitre, Aug 06 2002
EXTENSIONS
More terms from Sascha Kurz, Jan 25 2003
Edited by R. J. Mathar, Aug 11 2008
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)