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!)
A349806 a(n) = A099610(n) - n^2. 2
14, 11, 6, 5, 8, 3, 2, 1, 4, 11, 2, 1, 8, 5, 10, 3, 2, 3, 4, 3, 4, 1, 4, 3, 4, 3, 2, 1, 2, 1, 4, 3, 10, 1, 2, 3, 2, 13, 6, 3, 4, 1, 2, 1, 6, 1, 6, 1, 6, 1, 2, 1, 2, 5, 2, 3, 12, 1, 6, 1, 16, 1, 4, 1, 2, 3, 8, 3, 2, 7, 4, 7, 2, 9, 2, 1, 4, 1, 2, 1, 22, 5, 2, 5, 6, 1, 2, 1, 18, 5, 4, 1, 2, 7, 6, 1, 2, 3, 8, 1, 6, 1, 8, 1, 4, 1, 4, 1, 4, 15, 12, 13, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
a(n) > 0 follows from the definition of A099610.
LINKS
MATHEMATICA
Module[{nn=120, p2p}, p2p=Union[Times@@@Subsets[Prime[Range[2, PrimePi[ Ceiling[ nn^2/3]]]], {2}]]; Table[SelectFirst[p2p, #>n^2&]-n^2, {n, nn}]] (* Harvey P. Dale, Dec 06 2021 *)
PROG
(Python)
from itertools import count
from sympy import factorint
def A349806(n):
for i in count(n**2+(n%2)+1, 2):
fs = factorint(i)
if len(fs) == 2 == sum(fs.values()):
return i-n**2 # Chai Wah Wu, Dec 05 2021
CROSSREFS
Cf. A099610.
Sequence in context: A147370 A140739 A305946 * A259531 A240815 A305938
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Dec 05 2021
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 25 11:30 EDT 2024. Contains 371967 sequences. (Running on oeis4.)