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.

A108511 a(n) is the smallest number m such that prime(m) = n*m - 1, or 0 if no such m exists.

Original entry on oeis.org

0, 2, 1, 0, 70, 182, 440, 1053, 0, 6458, 0, 40087, 0, 251737, 637320, 1617173, 4124466, 10553445, 27067100, 69709705, 179992910, 465769811, 0, 3140421738, 8179002128, 21338685403, 0, 0, 382465573528, 0, 0, 6935812012545, 18262325820324, 0, 0, 335276334036937
Offset: 1

Views

Author

Farideh Firoozbakht, Jun 12 2005

Keywords

Comments

A108512(n) gives number of solutions of the equation prime(x) = n*x - 1.

Examples

			a(26) = 21338685403 because prime(21338685403) = 26*21338685403 - 1 and 21338685403 is the smallest (only) number m with this property.
		

Crossrefs

Extensions

a(29)-a(33) from Donovan Johnson, Nov 15 2009
a(34)-a(36) from Jinyuan Wang, Aug 09 2021