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.

A088252 n-th row of the following triangle contains smallest set of n primes which form n successive terms of an arithmetic progression from the 2nd to (n+1)th term with the first term 1. Sequence contains the leading diagonal.

Original entry on oeis.org

2, 3, 7, 1321, 54151, 152461, 3589741, 4102561, 116645455081, 4344917276701, 20825699190451, 852277147361641, 11417019330356641
Offset: 1

Views

Author

Amarnath Murthy, Sep 26 2003

Keywords

Comments

Conjectures: (1) Sequence is infinite. (2) For every n there are infinitely many arithmetic progressions with n successive primes.
A088252(n)=n*A088250(n)+1=n*A088251(n)-n+1. - Farideh Firoozbakht, Feb 21 2004

Examples

			2
2 3
3 5 7
331 661 991 1321
...
		

Crossrefs

Extensions

More terms from Farideh Firoozbakht, Feb 21 2004