A121088 - OEIS

A121088

Number of primitive Pythagorean-like triples a^2+b^2=c^2+k for k=5 with 0<c<=10^n.

1, 20, 202, 2046, 20589, 205489, 2055224, 20551650, 205500435

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Table of n, a(n) for n=1..9.

EXAMPLE

a(1)=1 because there is one solution (a,b,c) as (4,5,6) 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, A121082, A121083, A121084, A121085, A121086, A121087

Sequence in context: A223753 A099197 A041766 * A302838 A302921 A334692

Adjacent sequences: A121085 A121086 A121087 * A121089 A121090 A121091

KEYWORD

more,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(6) corrected and a(7) added by Max Alekseyev, Jul 04 2011

a(8)-a(9) from Lars Blomberg, Dec 22 2015

STATUS

approved