cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A034017 Numbers that are primitively represented by x^2 + xy + y^2.

Original entry on oeis.org

0, 1, 3, 7, 13, 19, 21, 31, 37, 39, 43, 49, 57, 61, 67, 73, 79, 91, 93, 97, 103, 109, 111, 127, 129, 133, 139, 147, 151, 157, 163, 169, 181, 183, 193, 199, 201, 211, 217, 219, 223, 229, 237, 241, 247, 259, 271, 273, 277, 283, 291, 301, 307, 309, 313, 327, 331
Offset: 1

Views

Author

Keywords

Comments

Gives the location of the nonzero terms of A000086.
Starting at a(3), a(n)^2 is the ordered semiperimeter of primitive integer Soddyian triangles (see A210484). - Frank M Jackson, Feb 04 2013
A000086(a(n)) > 0; a(n) = A004611(k) or a(n) = 3*A004611(k) for n > 3 and an appropriate k. - Reinhard Zumkeller, Jun 23 2013
The number of structure units in an icosahedral virus is 20*a(n), see Stannard link. - Charles R Greathouse IV, Nov 03 2015
From Wolfdieter Lang, Apr 09 2021: (Start)
The positive definite binary quadratic form F = [1, 1, 1], that is x^2 + x*y + y^2, has discriminant Disc = -3, and class number 1 (see Buell, Examples, p. 19, first line: Delta = -3, h = 1). This reduced form is equivalent to the form [1,-1, 1], but to no other reduced one (see Buell, Theorem 2.4, p. 15).
This form F represents a positive integer k (= a(n)) properly if and only if A002061(j+1) = 2*T(j) + 1 = j^2 + j + 1 == 0 (mod k), for j from {0, 1, ..., k-1}. This congruence determines the representative parallel primitive forms (rpapfs) of discriminant Disc = -3 and representation of a positive integer number k, given by [k, 2*j+1, c(j)], and c(j) is determined from Disc =-3 as c(j) = ((2*j+1)^2 + 3)/(4*k) = (j^2 + j + 1)/k. Each rpapf has a first reduced form, the so-called right neighbor form, namely [1, 1, 1] for k = 1 = a(1) (the already reduced parallel form from j = 0), and [1, -1, 1] for k = a(n), with n >= 2.
Only odd numbers k are eligible for representation, because 2*T(j) + 1, with the triangular numbers T = A000217, is odd. The odd k with at least one solution of the congruence are then the members of the present sequence.
The solutions of the reduced forms F = [1, 1, 1] and F' = [1, -1, 1] representing k are related by type I equivalence because of the first two entries ([a, a, c] == [a, -a, c]), and also by type II equivalence because [a, b, a] == [a, -b, a], for positive b. These transformation matrices are R_I = Matrix([1, -1],[0, 1]) and R_{II} = Matrix([0, -1], [1, 0]), respectively, to obtain the forms with negative second entry from the ones with positive second entry. The corresponding solutions (x, y)^t (t for transposed) are related by the inverse of these matrices.
The table with the A341422(n) solutions j of the congruence given above are given in A343232. (End)
Apparently, also the integers k that can be expressed as a quotient of two terms from A002061. - Martin Becker, Aug 14 2022
For some x, y let a(n) = r, x*(x+y) = s, y*(x+y) = t, x*y = u then (r,s,t,u) is a Pythagorean quadruple such that r^2 = s^2 + t^2 + u^2. - Frank M Jackson, Feb 26 2024

References

  • B. C. Berndt and R. A. Rankin, Ramanujan: Letters and Commentary, see p. 184, AMS, Providence, RI, 1995.
  • D. A. Buell, Binary Quadratic Forms, Springer, 1989, pp. 15, 19.

Crossrefs

Cf. A000217, A002061, A002476, A003136, A007645 (primes), A045611, A045897, A226946 (complement), A045897 (subsequence), A341422, A343232.

Programs

  • Haskell
    a034017 n = a034017_list !! (n-1)
    a034017_list = 0 : filter ((> 0) . a000086) [1..]
    -- Reinhard Zumkeller, Jun 23 2013
  • Maple
    N:= 1000: # to get all terms <= N
    P:= select(isprime, [seq(6*n+1, n=1..floor((N-1)/6))]):
    A:= {1,3}:
    for p in P do
      A:= {seq(seq(a*p^k, k=0..floor(log[p](N/a))),a=A)}:
    od:
    sort(convert(A,list)); # Robert Israel, Nov 04 2015
  • Mathematica
    lst = {0}; maxLen = 331; Do[If[Reduce[m^2 + m*n + n^2 == k && m >= n >= 0 && GCD[m, n] == 1, {m, n}, Integers] === False, , AppendTo[lst, k]], {k, maxLen}]; lst (* Frank M Jackson, Jan 10 2013 *) (* simplified by T. D. Noe, Feb 05 2013 *)
  • PARI
    is(n)=my(f=factor(n));for(i=1,#f[,1],if(f[i,1]%3!=1 && (f[i,1]!=3 || f[i,2]>1), return(n==0))); 1 \\ Charles R Greathouse IV, Jan 10 2013
    
  • PARI
    list(lim)=if(lim<7, return(select(n->n<=lim, [0,1,3]))); my(v=List([0,1,3])); for(x=1,sqrtint(lim\=1), my(y,t); while(y++Charles R Greathouse IV, Jan 20 2022
    

Formula

Extensions

Extended by Ray Chandler, Jan 29 2009

A250310 Numbers whose squares are of the form x^2 + y^2 + 3 where x >= y >= 0 (repetitions omitted).

Original entry on oeis.org

2, 4, 8, 10, 14, 20, 22, 26, 32, 34, 40, 44, 46, 52, 56, 58, 64, 68, 74, 80, 86, 88, 92, 94, 98, 100, 110, 112, 118, 124, 128, 130, 134, 136, 140, 142, 146, 148, 152, 158, 164, 172, 178, 184, 190, 194, 202, 206, 208, 212, 218, 220, 230, 238, 242, 244, 250, 254, 256, 266, 268, 274, 278, 290, 296, 298
Offset: 1

Views

Author

Frank M Jackson and Stalislav Takhaev, Jan 24 2015

Keywords

Comments

There exists a K-class of Heronian triangles such that the sum of the tangents of their half angles is a constant K > 1, iff K^2-3 is the sum of two squares. E.g., for K = 2 (x=1, y=0) we generate the class of integer Soddyian triangles (see A034017, A210484). For K = 4 (x=2, y=3) the class generated is Heronian triangles with the ratio of r_i : r_o : r = 1 : 3 : 6 where r is their inradius and r_i, r_o are the radii of their inner and outer Soddy circles.
Also because K^2-3 is the sum of two squares it must be congruent to 1 (mod 4). Consequently K is even.
Numbers k such that k^2-3 is in A001481. - Robert Israel, Feb 05 2019
From William P. Orrick, Nov 14 2024: (Start)
Let t = z^2 + z + 1 for some nonnegative integer z, and suppose that t = r * s for some positive integers r and s with r > s. Then (x,y) = (2*z + 1,r - s) has the property that x^2 + y^2 + 3 = (r + s)^2. Hence r + s is a member of this sequence.
Given (x,y) such that x^2 + y^2 + 3 is a square, one of x and y is odd, which we can take to be x, and the other even, which we then take to be y. Let z = (x - 1) / 2. Then 4 * (z^2 + z + 1) + y^2 is an even square, which we can call q^2. Hence z^2 + z + 1 factorizes into integer factors r = (q + y) / 2 and s = (q - y) / 2. Therefore all elements of this sequence are obtained by choosing a nonnegative integer z and a factor r of z^2 + z + 1 and forming the sum r + (z^2 + z + 1) / r.
Using the notation of the preceding two comments, the 2 by 2 matrix [[-z,r],[-s,1+z]] has both determinant and trace equal to 1, implying that it is an element of the modular group of order 3. Forming the product of the order-2 matrix [[0,-1],[1,0]] with this matrix gives the matrix [[s,-1-z],[-z,r]], which has trace r + s. Since all elements of the modular group that are a product of an element of order 2 and an element of order 3 can be obtained from a matrix of the form above by conjugation, this sequence consists of the traces of elements of the modular group that can be expressed as such a product. (This ignores the sign of the trace, which is immaterial if matrices are understood to represent fractional linear transformations.)
(End)

Examples

			a(4) = 10 as 10^2 - 3 = 9^2 + 4^2 and 10 is the 4th such occurrence.
		

Crossrefs

Programs

  • Maple
    filter:= proc(n) local F;
      F:= ifactors(n^2-3)[2];
      andmap(t -> t[1] mod 4 <> 3 or t[2]::even, F)
    end proc:
    select(filter, [seq(i,i=2..1000,2)]); # Robert Israel, Feb 05 2019
  • Mathematica
    lst = {}; Do[If[IntegerQ[k=Sqrt[m^2+n^2+3]], AppendTo[lst, k]], {m, 0, 1000}, {n, 0, m}]; Union@lst
  • Python
    from itertools import count, islice
    from sympy import factorint
    def A250310_gen(): # generator of terms
        return filter(lambda n:all(p & 3 != 3 or e & 1 == 0 for p, e in factorint(n**2-3).items()),count(2))
    A250310_list = list(islice(A250310_gen(),30)) # Chai Wah Wu, Jun 27 2022

Extensions

Edited by Robert Israel, Feb 05 2019

A367737 Ordered product of the terms in a primitive Pythagorean quadruple (with repetitions).

Original entry on oeis.org

12, 252, 288, 1008, 1188, 1872, 2052, 2100, 2448, 2772, 3300, 8400, 8448, 9108, 9828, 11628, 12768, 13500, 14688, 17100, 17388, 17388, 17472, 18900, 25500, 27900, 29568, 29568, 31968, 32292, 32508, 33408, 50388, 51612, 54000, 58212, 58812, 60372, 62100, 62832, 63072, 65472, 65892, 69300, 69972
Offset: 1

Views

Author

Frank M Jackson, Nov 28 2023

Keywords

Comments

Every primitive Pythagorean quadruple (PPQ) generates a distinct Heronian triangle. This sequence is the area of such a triangle. If a, b, c, d form a PPQ where a^2 + b^2 + c^2 = d^2 it generates a primitive Heronian triangle whose three sides are b^2 + c^2, a^2 + c^2, a^2 + b^2. Its semiperimeter is d^2 and its area is a*b*c*d. It has an inradius and three exradii as a*b*c/d, b*c*d/a, a*c*d/b, a*b*d/c respectively.
a(n) == 0 mod 12.
A210484 is a subsequence because an integer Soddyian triangle has area m^2n^2(m+n)^2(m^2+mn+n^2) and semiperimeter (m^2+mn+n^2)^2 = m^2*n^2 + n^2(m+n)^2 + m^2(m+n)^2 where m >= n and GCD(m,n) = 1. This is a PPQ.

Examples

			a(5)=1188 because the 5th occurrence of a PPQ sorted by the product of its term is (2, 6, 9, 11) and 1188 = 11*9*6*2.
		

Crossrefs

Programs

  • Mathematica
    lst = {}; Do[lst=Join[lst,Select[PowersRepresentations[k^2, 3, 2],Times@@#!=0&&GCD@@#==1 &]], {k, 1, 100}]; lst1=Sort@(Table[{a, b, c}=lst[[n]]; a*b*c*Sqrt[a^2+b^2+c^2], {n, 1, Length@lst}]); lst1[[1;;50]]

A228475 Positive real root of 37*x^4+36*x^3+6*x^2-12*x-3.

Original entry on oeis.org

5, 1, 6, 5, 8, 7, 7, 2, 2, 1, 5, 4, 0, 5, 2, 6, 4, 7, 1, 2, 5, 3, 2, 9, 8, 8, 0, 7, 7, 4, 8, 5, 0, 5, 2, 4, 7, 8, 6, 3, 8, 5, 8, 8, 8, 8, 3, 4, 7, 7, 7, 5, 6, 9, 9, 3, 4, 9, 2, 7, 5, 8, 3, 1, 4, 9, 6, 6, 2, 6, 7, 5, 5, 1, 9, 2, 9, 4, 5, 0, 4, 9, 8
Offset: 0

Views

Author

Frank M Jackson, Aug 23 2013

Keywords

Comments

A Soddyian triangle is a triangle whose outer Soddy circle has degenerated into a straight line. Its side lengths are related by the equation 1/sqrt(s-c)=1/sqrt(s-b)+1/sqrt(s-a) where the sides a<=b<=c and s is the semiperimeter. If the side lengths of such a triangle form an arithmetic progression 1, 1+d, 1+2d, where d is the common difference, then d = 0.5165877... and is the solution to the equation 37d^4+36d^3+6d^2-12d-3 = 0 such that 0

Examples

			0.51658772215405264712532988077485052478638588883477756993492758314966...
		

Crossrefs

Cf. A210484.

Programs

  • Mathematica
    a=1; b=1+d; c=1+2d; s=(a+b+c)/2; sol=Solve[1/Sqrt[s-a]+1/Sqrt[s-b]-1/Sqrt[s-c]==0&&0
    				
  • PARI
    polrootsreal(37*x^4+36*x^3+6*x^2-12*x-3)[2] \\ Charles R Greathouse IV, Apr 16 2014

Formula

d = (-18+16*sqrt(3)+37*sqrt((608*sqrt(3))/1369-240/1369))/74.
Showing 1-4 of 4 results.