OFFSET
1,1
COMMENTS
LINKS
Michael De Vlieger, Table of n, a(n) for n = 1..1256 (all terms m <= 10000)
David Lovler, Decomposition of a(n) into A327261(k)
EXAMPLE
72 is in the sequence because 72 = A327259(2,2,5) = A327259(6,6) and 2, 5 and 6 are in A327261. A327259(2,2,5) is well-defined because A327259(n,k) is associative.
221 is in the sequence because 221 = A327259(5,25) = A327259(11,11) and 5, 11 and 25 are in A327261.
462 is in the sequence because 462 = A327259(6,39) = A327259(11,22) = A327259(14,17) and 6, 11, 14, 17, 22 and 39 are in A327261.
The first six terms and their decompositions:
More in a-file.
MATHEMATICA
T[n_, k_]:=2n*k-If[Mod[n, 2]==1, If[Mod[k, 2]==1, n+k-1, k], If[Mod[k, 2]==1, n, 0]]; F[d_]:=If[(q=Union[Sort/@(Position[Table[T[n, k], {n, 2, Ceiling[d/3]}, {k, 2, Ceiling[d/3]}], d]+1)])=={}, {{d}}, q]; FC[x_]:=FixedPoint[Union[Sort/@Flatten[Flatten/@Tuples[#]&/@((F/@#&/@#)&[#]), 1]]&, F[x]]; list={}; Do[If[Length@FC@i>1, AppendTo[list, i]], {i, 300}]; list (* Giorgos Kalogeropoulos, Nov 05 2021 *)
CROSSREFS
KEYWORD
nonn
AUTHOR
David Lovler, Oct 31 2021
EXTENSIONS
Name amended by David Lovler, Jan 26 2022
STATUS
approved