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!)
A229838 Consider all primitive 60-degree triangles with sides A < B < C. The sequence gives the values of A. 1

%I #20 Oct 07 2013 06:17:35

%S 3,5,7,8,9,11,13,15,16,17,19,21,23,24,25,27,29,31,32,33,35,37,39,40,

%T 41,43,45,47,48,49,51,53,55,56,57,59,61,63,64,65,67,69,71,72,73,75,77,

%U 79,80,81,83,85,87,88,89,91,93,95,96,97,99,101,103,104,105

%N Consider all primitive 60-degree triangles with sides A < B < C. The sequence gives the values of A.

%C A primitive triangle is one for which the sides have no common factor.

%C A004611 gives the values of B, and A089025 gives the values of C.

%H Wikipedia, <a href="https://en.wikipedia.org/wiki/Integer_triangle">Integer triangle</a>

%F Empirical g.f.: -x*(x^5-x^4-x^3-2*x^2-2*x-3) / ((x-1)^2*(x^4+x^3+x^2+x+1)).

%e 7 appears in the sequence because there exists a primitive 60-degree triangle with sides 7, 37 and 40.

%o (PARI)

%o \\ Gives terms not exceeding amax

%o \\ e.g. pt60a(25) gives [3,5,7,8,9,11,13,15,16,17,19,21,23,24,25]

%o pt60a(amax) = {

%o s=[];

%o for(m=1, amax\2,

%o for(n=1, m-1,

%o if((m-n)%3!=0 && gcd(m, n)==1,

%o if(2*m*n+n*n<=amax, s=concat(s, 2*m*n+n*n));

%o if(m*m-n*n<=amax, s=concat(s, m*m-n*n))

%o )

%o )

%o );

%o vecsort(s,,8)

%o }

%Y Cf. A004611, A089025, A229839.

%K nonn

%O 1,1

%A _Colin Barker_, Oct 01 2013

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 September 13 00:40 EDT 2024. Contains 375857 sequences. (Running on oeis4.)