login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A115105 Numbers of the form p^F(n)*q^F(n), where p and q are distinct primes; F(n) is a Fibonacci number. 0
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 43, 44, 45, 46, 47, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 61, 62, 63, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 82, 83 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

All divisors >1 of the terms are also in the sequence. All primes in the sequence are of form p^F(0)*q^F(1) iff p^0=1.

LINKS

Table of n, a(n) for n=1..70.

EXAMPLE

a(1) = 1 because 2^0*3^0 = 1;

a(3) = 3 because 3^1*5^0 = 3;

a(4) = 4 because 2^2*3^0 = 4;

a(6) = 6 because 2^1*3^1 = 6.

CROSSREFS

Cf. A115063.

Sequence in context: A023809 A046100 A023757 * A121176 A028261 A119675

Adjacent sequences:  A115102 A115103 A115104 * A115106 A115107 A115108

KEYWORD

nonn

AUTHOR

Giovanni Teofilatto, Mar 03 2006; corrected Mar 04 2006

STATUS

approved

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

Content is available under The OEIS End-User License Agreement .

Last modified November 27 17:39 EST 2014. Contains 250249 sequences.