Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075742
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075742 Fibonacci numbers, which are the product of an odd number of distinct primes for numbers with the same property (mu(n)=mu(fibonacci(n)=-1). +0
1
2, 5, 13, 89, 233, 1597, 28657, 514229, 24157817, 433494437, 2971215073, 44945570212853, 190392490709135, 99194853094755497, 83621143489848422977, 1500520536206896083277, 3928413764606871165730 (list; graph; listen)
OFFSET

1,1

EXAMPLE

11 is a prime and fibonacci(11)=89 is a prime, 13 is a prime and fibonacci(13)=233 is a prime, but fibonacci(16)=987=3*7*47 and 16 is not square-free and 30=2*3*5 is the product of an odd number of distinct primes but fibonacci(30)=832040=2^3*5*11*31*61 is not square-free, ...

MAPLE

with(combinat, fibonacci): m2_supM_fib := proc(n); if (numtheory[mobius](n)=-1) then if (numtheory[mobius](fibonacci(n))=-1) then RETURN(fibonacci(n)); fi; fi; end:

CROSSREFS

Cf. A000045, A030059, A074691.

Sequence in context: A032015 A075736 A030426 this_sequence A075737 A100843 A082101

Adjacent sequences: A075739 A075740 A075741 this_sequence A075743 A075744 A075745

KEYWORD

easy,nonn

AUTHOR

Jani Melik (jani_melik(AT)hotmail.com), Oct 07 2002

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 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research