cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A140258 Minimal multiples from A016089 of primes from A129729.

Original entry on oeis.org

2, 6, 1926, 2471058, 38259378, 41218326, 600917778, 114130755846, 600929334, 28312987734, 342397209654, 722113254, 15559317470256498, 84332966140854, 20543988255894, 1314244621926, 600935058, 6739452314987202
Offset: 1

Views

Author

Max Alekseyev, May 16 2008

Keywords

Comments

A016089 lists numbers n such that n divide n-th Lucas number A000032(n) while A129729 lists all possible prime divisors of elements of A016089 in the increasing order. This sequence lists minimal multiples from A016089 of primes from A129729.

Formula

a(n) = min { A016089(m) : A129729(n)|A016089(m) }