login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A121084 Number of primitive Pythagorean-like triples a^2+b^2=c^2+k for k=2 with 0<c<=10^n. 3
1, 10, 100, 983, 9912, 99211, 991714 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
EXAMPLE
a(1)=1 because there is one solution (a,b,c) as (3,3,4) 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: A136858 A334612 A125948 * A272501 A171284 A125897
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
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 18 22:56 EDT 2024. Contains 370952 sequences. (Running on oeis4.)