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.

A064496 a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12).

Original entry on oeis.org

7, 7, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 11, 7, 11, 7, 7, 7, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 7, 11, 7, 11, 7, 11, 11, 7, 7, 7, 7, 11, 7, 7, 11, 11, 7, 7, 11, 11, 11, 11, 7, 7, 11, 11, 7, 11, 11, 7, 11, 7
Offset: 1

Views

Author

Jon Perry, Oct 05 2001

Keywords

Comments

Original name: Values of n such that 4j = np+1 where p = 8x+1, x integer, p prime and j mod 3 = 0.

Examples

			For example, A007519(1)=17, 4j=17p+1 implies k is 7 and j is 30. The values that give 7 form the basis for solutions for the Erdős-Straus conjecture: 4/n=1/a+1/b+1/c for n >= 2, a,b,c>0 and integers.
		

Extensions

Entry revised by Sean A. Irvine, Jul 14 2023