|
| |
|
|
A114419
|
|
Smallest number a(n) such that Fibonacci(a(n)) is a multiple of primorial(n).
|
|
0
| |
|
|
3, 12, 60, 120, 120, 840, 2520, 2520, 2520, 2520, 2520, 47880, 47880, 526680, 1053360, 3160080, 91642320, 91642320, 1557919440, 1557919440, 57643019280, 749359250640, 749359250640, 749359250640, 5245514754480, 26227573772400
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Because the Fibonacci numbers form a divisibility sequence, each term of this sequence is a multiple of the previous term. The multiple can be computed using A001602. [From T. D. Noe (noe(AT)sspectra.com), May 04 2009]
|
|
|
FORMULA
| a(n) = {min j: A002110(n) | A000045(j)}. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 31 2008
a(n) = lcm(A001602(1),...,A001602(n)) [From T. D. Noe (noe(AT)sspectra.com), May 04 2009]
|
|
|
EXAMPLE
| a(2)=12 because 12th fibonacci number i.e. 144 is the smallest fibonacci number which is a multiple of primorial(2) i.e. 6
|
|
|
CROSSREFS
| Cf. A002110, A000045.
Sequence in context: A020102 A201013 A065080 * A090830 A127918 A069944
Adjacent sequences: A114416 A114417 A114418 * A114420 A114421 A114422
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Shyam Sunder Gupta (guptass(AT)rediffmail.com), Feb 12 2006
|
|
|
EXTENSIONS
| a(1) corrected and a(14) added by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 31 2008
a(14)-a(18) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Sep 03 2008
Extended by T. D. Noe (noe(AT)sspectra.com), May 04 2009
|
| |
|
|
