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.

A152829 Numbers k whose squares can be written in exactly one way as a sum of three squares: k^2 = a^2 + b^2 + c^2 with 1 <= a <= b <= c.

Original entry on oeis.org

3, 6, 7, 12, 13, 14, 24, 26, 28, 48, 52, 56, 96, 104, 112, 192, 208, 224, 384, 416, 448, 768, 832, 896, 1536, 1664, 1792, 3072, 3328, 3584, 6144, 6656, 7168, 12288, 13312, 14336, 24576, 26624, 28672, 49152, 53248, 57344, 98304, 106496, 114688, 196608, 212992, 229376
Offset: 1

Views

Author

Peter Pein (petsie(AT)dordos.net), Dec 13 2008

Keywords

Comments

Numbers k such that k^2 is in A025321. - Joerg Arndt, Mar 22 2022
2k is a term iff k is also a term, so the conjecture from Colin Barker (see Formula) is true iff 3, 7, and 13 are the only odd terms. - Jon E. Schoenfield, Mar 22 2022

Examples

			9 is not in this sequence because 9^2 = 1^2 + 4^2 + 8^2 = 3^2 + 6^2 + 6^2 = 4^2 + 4^2 + 7^2.
7 is in this sequence because 7^2 = 2^2 + 3^2 + 6^2 is the only way to write 7^2 as a sum of three squares.
		

Crossrefs

Cf. A025321.

Programs

  • C
    #include 
    #include 
    int main (int argc, char *argv[]) {
        long n,n2,a,a2,b,b2,c,c2; int s = 0; n=atol(argv[1]); n2=n*n;
        for (a=1; a 3sq.txt
    # gives the terms less than 1000

Formula

Guessed o.g.f.: x*(x^4 + 6*x^3 + 7*x^2 + 6*x + 3)/(1 - 2*x^3).
{k: A025427(k^2)=1}. - R. J. Mathar, Dec 15 2008
Conjecture: a(n) = 2*a(n-3) for n > 5. - Colin Barker, Mar 12 2012

Extensions

a(25)-a(36) (from comment) verified and added by Donovan Johnson, Nov 08 2013
a(37)-a(48) from Jon E. Schoenfield, Mar 22 2022