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.

A085873 a(1) = 2; a(n)= smallest prime of the form k*a(n-1) + 1 where k itself is a multiple of n.

Original entry on oeis.org

2, 5, 31, 373, 22381, 134287, 3760037, 481284737, 25989375799, 6237450191761, 411671712656227, 64220787174371413, 73468580527480896473, 1028560127384732550623, 185140822929251859112141
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2003

Keywords

Examples

			a(2)= 5 = 2*2 + 1, a(3) = 6*5 + 1, a(4) = 12*31 + 1; 2,6 and 12 are respectively multiples of 2, 3 and 4.
		

Extensions

More terms from Ray Chandler, Jul 08 2003
Corrected by T. D. Noe, Nov 15 2006