A106267 Least c such that A106265(n) + b^2 = c^3 for some b (given in A106266).

1, 3, 2, 2, 2, 3, 17, 4, 3, 7, 6, 3, 5, 3, 3, 4, 11, 4, 14, 5, 21, 6, 4, 65, 9, 7, 4, 18, 4, 5, 4, 4, 23, 8, 6, 99, 5, 20, 13, 27, 7, 5, 6, 5, 9, 11, 143, 5, 8, 5, 7, 5, 5, 5, 15, 16, 12, 6, 47, 14, 195, 7, 197, 175, 8, 6, 9, 51, 10, 6, 59, 13, 7, 11, 6

Offset: 1

Author

Zak Seidov, Apr 28 2005

Keywords

• nonn

Links

• M. F. Hasler, Table of n, a(n) for n = 1..2500 (replacing an incomplete version from 2013), Aug 10 2024

Crossrefs

Cf. A106265 (main entry), A106266 (the b-values).

Programs

PARI

for(a=1, 999, (c=is_A106265(a))&& print1(c", ")) \\ M. F. Hasler, Oct 04 2013, edited Aug 10 2024: main program moved to A106265, as function is_A106265 which returns the (least) c-value a(n), always nonzero for terms of A106265, or 0 if the argument isn't a term of A106265.

Formula

a(n) = (A106265(n) + A106266(n)^2)^(1/3). - M. F. Hasler, Oct 04 2013

Extensions

More terms from Robert G. Wilson v, Apr 28 2005

All values recomputed from A106266 and A106265 by R. J. Mathar, Aug 24 2008

Initial term 1 and other solutions with b=0 added by M. F. Hasler, Oct 04 2013