Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A076212
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A076212 Numbers n such that n and Fibonacci(n) have the same number of prime factors. +0
1
1, 3, 5, 7, 9, 10, 11, 13, 14, 17, 22, 23, 26, 29, 34, 43, 47, 64, 83, 94, 121, 131, 137, 359 (list; graph; listen)
OFFSET

1,2

COMMENT

More precisely, numbers n such that Omega(n) = Omega(Fibonacci(n)), where Omega(n) (A001222) denotes the number of prime factors of n, counting multiplicity.

EXAMPLE

a(6)=9 because 9 and 9th Fibonacci number (i.e. 34) have the same number of prime factors i.e. 2

MAPLE

with(numtheory): with(combinat): a:=proc(n) if bigomega(n)=bigomega(fibonacci(n)) then n else fi end: seq(a(n), n=1..150); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 15 2006

MATHEMATICA

Omega[n_] := Apply[Plus, Transpose[FactorInteger[n]][[2]]]; Flatten[Append[{1}, Select[Range[3, 150], Omega[ # ] == Omega[Fibonacci[ # ]] &]]]

KEYWORD

more,nonn,new

AUTHOR

Joseph L. Pe (joseph_l_pe(AT)hotmail.com), Nov 03 2002

EXTENSIONS

359 from Harvey P. Dale (hpd1(AT)nyu.edu), May 01 2008

Edited by R. J. Mathar, Aug 11 2008

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research