|
| |
| |
| |
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Starting with the fraction 1/1, generate the sequence of fractions A002533(i)/A002532(i) according to
the rule: "add top and bottom to get the new bottom, add top and 6 times bottom to get the new top."
The prime numerators of these fractions are listed here, at locations i= 2, 3, 4, 5, 11, 17, 32, 53,...
showing prime(4), prime(8), prime(21), prime(53), prime(34719),..
Is there an infinity of primes in this sequence?
|
|
|
REFERENCES
| Prime Obsession, John Derbyshire, Joseph Henry Press, April 2004, p 16.
|
|
|
FORMULA
| A002533 INTERSECT A000040.
|
|
|
PROG
| (PARI) primenum(n, k, typ) = \\ k=mult, typ=1 num, 2 denom. output prime num or denom.
{ local(a, b, x, tmp, v); a=1; b=1;
for(x=1, n, tmp=b; b=a+b; a=k*tmp+a; if(typ==1, v=a, v=b); if(isprime(v), print1(v", "); ) );
print(); print(a/b+.) }
|
|
|
CROSSREFS
| Sequence in context: A005516 A152008 A002533 * A144723 A062551 A155390
Adjacent sequences: A111008 A111009 A111010 * A111012 A111013 A111014
|
|
|
KEYWORD
| easy,nonn
|
|
|
AUTHOR
| Cino Hilliard (hillcino368(AT)hotmail.com), Oct 02 2005
|
|
|
EXTENSIONS
| Simplified the definition, listed some A002533 indices. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 16 2009
|
| |
|
|
