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!)
A204897 a(n) = (p(n)-q(n))/n, where (p(n), q(n)) is the least pair of primes for which n divides p(n)-q(n). 4
1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,7
COMMENTS
For a guide to related sequences, see A204892.
It seems that a(A007921(n)) = 2 for all n. - Antti Karttunen, Oct 09 2018
LINKS
EXAMPLE
(3-2)/1=1
(5-3)/2=1
(5-2)/3=1
(7-3)/4=1
(7-2)/5=1
(11-5)/6=1
(17-3)/7=2
MATHEMATICA
(See the program at A204892.)
PROG
(PARI) A204897(n) = { my(d); forprime(p=3, oo, forprime(q=2, p-1, if(!((d=(p-q))%n), return(d/n), if(d<n, break)))); }; \\ Antti Karttunen, Oct 09 2018
CROSSREFS
Sequence in context: A043279 A050433 A031263 * A262618 A347447 A107577
KEYWORD
nonn
AUTHOR
Clark Kimberling, Jan 20 2012
EXTENSIONS
More terms from Antti Karttunen, Oct 09 2018
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 March 29 10:22 EDT 2024. Contains 371268 sequences. (Running on oeis4.)