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
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 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
Original name: Values of n such that 4j = np+1 where p = 8x+1, x integer, p prime and j mod 3 = 0.
LINKS
EXAMPLE
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.
CROSSREFS
Sequence in context: A306530 A094460 A070642 * A084513 A084523 A336019
KEYWORD
nonn
AUTHOR
Jon Perry, Oct 05 2001
EXTENSIONS
Entry revised by Sean A. Irvine, Jul 14 2023
STATUS
approved

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 April 16 18:22 EDT 2024. Contains 371750 sequences. (Running on oeis4.)