login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A121087
Number of primitive Pythagorean-like triples a^2+b^2=c^2+k for k=-5 with 0<c<=10^n.
3
1, 22, 223, 2217, 22354, 223667, 2235713, 22360389, 223610157
OFFSET
1,2
COMMENTS
It is conjectured by the first author that a(n)/10^n as n->inf is 1/(2*sqrt(5)) = 0.22360...
EXAMPLE
a(1)=1 because there is one solution (a,b,c) as (2,4,5) with 0<c<=10^1.
MATHEMATICA
(* 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]
CROSSREFS
Cf. A101931.
Sequence in context: A331882 A008453 A290362 * A133719 A008948 A003909
KEYWORD
nonn
AUTHOR
Tito Piezas III, Aug 11 2006
EXTENSIONS
First few terms found by Tito Piezas III, 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, May 30 2007
a(8)-a(9) from Lars Blomberg, Dec 22 2015
STATUS
approved