The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A072360 One-sixth the area of the smallest primitive d-arithmetic triangle, where d=A072330(n). 8
 1, 26, 21, 91, 95, 196, 341, 536, 790, 259, 559, 1030, 654, 2926, 549, 4029, 1241, 4706, 5529, 5335, 1729, 1001, 1544, 2786, 9324, 12649, 4446, 8645, 9591, 1651, 3059, 10234, 3010, 3925, 19005, 2535, 16676, 14174, 8074, 25620, 33205, 8060 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Such a triangle has middle side 2*x'. LINKS Jean-François Alcover, Table of n, a(n) for n = 1..1000 FORMULA a(n) = x'*y'/2, where (x', y') is the fundamental solution to x^2 - 3*y^2 = d^2, where d=A072330(n). MATHEMATICA terms = 1000; nmax = 12 terms; okQ[n_] := AllTrue[FactorInteger[n][[All, 1]], MatchQ[Mod[#, 12], 1|11]&]; A072330 = Select[Range[nmax], okQ]; a[n_] := Module[{a, b, c, d, p, area}, d = If[n <= Length[A072330], A072330[[n]], Print["nmax = ", nmax, " insufficient"]; Exit[]]; If[n == 1, 1, For[b = 2 d, True, b++, a = b - d; c = b + d; p = (a + b + c)/2; If[IntegerQ[p] && IntegerQ[area = Sqrt[p (p - a) (p - b) (p - c)]] && GCD[a, b, c] == 1, Return[area/6]]]]]; a /@ Range[terms] (* Jean-François Alcover, Mar 07 2020 *) CROSSREFS Cf. A072330, A086909, A089019, A089020, A096672, A096673, A096674. Sequence in context: A154295 A331498 A277685 * A205322 A291470 A093538 Adjacent sequences:  A072357 A072358 A072359 * A072361 A072362 A072363 KEYWORD nonn AUTHOR Lekraj Beedassy, Jul 18 2002 EXTENSIONS Edited, corrected and extended by Ray Chandler, Jul 03 2004 STATUS approved

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

Last modified March 31 18:53 EDT 2020. Contains 333151 sequences. (Running on oeis4.)