The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A064496 a(n) is the least k such that k * A007519(n) + 1 = 0 (mod 12). 0

%I #9 Jul 14 2023 16:33:00

%S 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,

%T 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,

%U 11,11,7,7,11,11,11,11,7,7,11,11,7,11,11,7,11,7

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

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

%H H. Mishima, <a href="http://www.asahi-net.or.jp/~KC2H-MSM/mathland/overview.htm">Overview of "Mathematician's Secret Room"</a>

%e 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.

%K nonn

%O 1,1

%A _Jon Perry_, Oct 05 2001

%E Entry revised by _Sean A. Irvine_, Jul 14 2023

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 14 03:35 EDT 2024. Contains 372528 sequences. (Running on oeis4.)