proposed

approved

editing

proposed

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] (* Courtesy of Daniel Lichtblau of Wolfram Research *)

approved

editing

proposed

approved

editing

proposed

3, 30, 293, 2881, 28871, 288685, 2886366, 28868362, 288673693, 2886752763

a(8)-a(10) from Hiroaki Yamanouchi, Oct 17 2015

approved

editing

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

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(7) from _Max Alekseyev (maxale(AT)gmail.com), _, Jul 03 2011

proposed

approved

3, 30, 293, 2881, 28871, 288685, 2886366

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). It is conjectured by the first author that a(n)/10^n as n->inf is 1/(2*sqrt(3)) = 0.28867...

Cf. A101931., A121082, A121083, A121084, A121086, A121087, A121088

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(7) from Max Alekseyev (maxale(AT)gmail.com), Jul 03 2011

approved

proposed