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!)
A248511 Difference between k and the least prime factor of k^2+1 where k is the n-th number with k^2+1 composite. 1

%I #13 Nov 02 2014 00:42:05

%S 1,3,5,3,7,9,7,11,13,15,13,17,19,17,21,23,25,23,27,13,29,27,31,21,33,

%T 35,33,37,39,37,41,31,43,17,45,43,47,9,49,47,51,53,55,53,57,47,59,57,

%U 61,47,63,65,63,67,57,69,67,71,73,23,75,73,77,43,79,77,81

%N Difference between k and the least prime factor of k^2+1 where k is the n-th number with k^2+1 composite.

%C a(n) = A134407(n) - least prime divisor of A134406(n).

%H Michel Lagneau, <a href="/A248511/b248511.txt">Table of n, a(n) for n = 1..10000</a>

%e a(1) = 1 because the first composite is 3^2+1 = 2*5 and 3-2 = 1.

%p with(numtheory):

%p for n from 1 to 200 do:

%p p:=n^2+1:x:=factorset(p):d:=n-x[1]:

%p if type(p,prime)=false

%p then

%p printf(`%d, `,d):

%p else

%p fi:

%p od:

%Y Cf. A002496, A020639, A089120, A134406, A134407.

%K nonn

%O 1,2

%A _Michel Lagneau_, Oct 07 2014

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 25 04:42 EDT 2024. Contains 371964 sequences. (Running on oeis4.)