OFFSET
1,2
COMMENTS
Subsequence of A056911. - Chai Wah Wu, Jan 07 2026
LINKS
Thomas Bloom, Problem #1109, Erdős Problems.
Thomas Bloom, Problem #1103, Erdős Problems.
MATHEMATICA
f[n_]:=Length[FindClique[RelationGraph[SquareFreeQ[#1+#2]&!=#2&, Select[Range[n], SquareFreeQ[2*#]&]]][[1]]];
Join[{1}, Select[Differences[Table[f[n], {n, 1, 400}]], #==1&->"Index"]+1]
PROG
(Python)
from itertools import count, islice
from networkx import empty_graph, find_cliques
from sympy import factorint
def A392165_gen(): # generator of terms
def is_squarefree(n): return max(factorint(n).values(), default=1)<2
c, G = 0, empty_graph([])
for n in count(1, 2):
if is_squarefree(n):
G.add_node(n)
G.add_edges_from((a, n) for a in G if a!=n and is_squarefree(a+n))
if (m:=max(len(c) for c in find_cliques(G, nodes=[n])))>c:
yield n
c = m
CROSSREFS
KEYWORD
nonn,more
AUTHOR
Elijah Beregovsky, Jan 02 2026
EXTENSIONS
a(22)-a(35) from Chai Wah Wu, Jan 07 2026
a(36)-a(39) from Chai Wah Wu, Jan 12 2026
STATUS
approved
