1,2

First few terms found by Tito Piezas III (tpiezas(AT)gmail.com), James Waldby (j-waldby(AT)pat7.com). Subsequent terms found by Andrzej Kozlowski (akoz(AT)mimuw.edu.pl), Daniel Lichtblau (danl(AT)wolfram.com).

a(1)=1 because there is one solution (a,b,c) as (3,3,4) with 0<c<=10^1.

Courtesy of Daniel Lichtblau of Wolfram Research: countTriples[m_, k_] := Module[ {c2, c2odd, total = 0, fax, g}, Do[ c2 = c^2 + k; If[c2 < 2, Continue[]]; c2odd = c2; While[EvenQ[c2odd], c2odd /= 2]; If [c2odd==1, If [OddQ[Log[2, c2]], total++ ]; Continue[]]; If[Mod[c2odd, 4] == 3, Continue[]]; g = GCD[c2odd, 100947]; If[g != 1 && g^2 != GCD[c2odd, 10190296809], Continue[]]; fax = Map[{Mod[ #[[1]], 4], #[[2]]}&, FactorInteger[c2odd]]; If[Apply[Or, Map[ #[[1]] == 3 && OddQ[ #[[2]]] &, fax]], Continue []]; fax = Cases[fax, {1, aa_}:>aa+1]; fax = Ceiling[Apply[Times, fax]/2]; total += fax; , {c, m}]; total]

Cf. A101931.

Adjacent sequences: A121081 A121082 A121083 this_sequence A121085 A121086 A121087

Sequence in context: A136876 A136858 A125948 this_sequence A125897 A055992 A115814

nonn

Tito Piezas III (tpiezas(AT)gmail.com), Aug 11 2006

a(7) from Max Alekseyev (maxal(AT)cs.ucsd.edu), May 30 2007