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-2 of 2 results.

A283239 Number of ways to write n as x^2 + y^2 + z*(3*z-1)/2 with x,y,z integers such that x + 2*y is a square.

Original entry on oeis.org

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

Views

Author

Zhi-Wei Sun, Mar 03 2017

Keywords

Comments

Conjecture: (i) a(n) > 0 for all n = 0,1,2,..., and a(n) = 1 only for n = 0, 8, 43, 84, 133, 253, 399, 488, 523, 803, 7369.
(ii) Any integer n > 1 can be written as p + x^2 + y^2 with p prime and x + 2*y (or x + 3*y) a square, where x is an integer and y is a nonnegative integer.
Note that those numbers z*(3*z-1)/2 with z integral are called generalized pentagonal numbers (A001318). By Theorem 1.7(ii) of the linked paper in Sci. China Math., each n = 0,1,2,... can be written as the sum of two squares and a generalized pentagonal number.
Ju. V. Linnik proved in 1960 that any sufficiently large integer can be expressed as the sum of a prime and two squares.

Examples

			a(8) = 1 since 8 = 1^2 + 0^2 + (-2)*(3*(-2)-1)/2 with 1 + 2*0 = 1^2.
a(43) = 1 since 43 = 1^2 + 4^2 + (-4)*(3*(-4)-1)/2 with 1 + 2*4 = 3^2.
a(84) = 1 since 84 = 7^2 + (-3)^2 + (-4)*(3*(-4)-1)/2 with 7 + 2*(-3) = 1^2.
a(133) = 1 since 133 = 4^2 + 0^2 + 9*(3*9-1)/2 with 4 + 2*0 = 2^2.
a(253) = 1 since 253 = (-13)^2 + 7^2 + 5*(3*5-1)/2 with (-13) + 2*7 = 1^2.
a(399) = 1 since 399 = 18^2 + (-7)^2 + (-4)*(3*(-4)-1)/2 with 18 + 2*(-7) = 2^2.
a(488) = 1 since 488 = 9^2 + 20^2 + (-2)*(3*(-2)-1)/2 with 9 + 2*20 = 7^2.
a(523) = 1 since 523 = 9^2 + 0^2 + (-17)*(3*(-17)-1)/2 with 9 + 2*0 = 3^2.
a(803) = 1 since 803 = (-17)^2 + 13^2 + (-15)*(3*(-15)-1)/2 with (-17) + 2*13 = 3^2.
a(7369) = 1 since 7369 = 0^2 + 72^2 + (-38)*(3*(-38)-1)/2 with 0 + 2*72 = 12^2.
		

Crossrefs

Programs

  • Mathematica
    SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
    PenQ[n_]:=PenQ[n]=SQ[24n+1];
    Do[r=0;Do[If[PenQ[n-x^2-y^2],Do[If[SQ[(-1)^i*x+2(-1)^j*y],r=r+1],{i,0,Min[x,1]},{j,0,Min[y,1]}]],{x,0,Sqrt[n]},{y,0,Sqrt[n-x^2]}];Print[n," ",r];Continue,{n,0,80}]

A340778 Decimal expansion of (2 - e*log(2))/4.

Original entry on oeis.org

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

Views

Author

Stefano Spezia, Jan 21 2021

Keywords

Comments

This constant appears in an asymptotic formula proved by Linnik in 1960 in an additive problem of Hardy-Littlewood (see Formula 1 in Dimitrov and Formula 0.3 in Linnik).

Examples

			0.02895765365906997252446022076864966632568373588631465...
		

Crossrefs

Programs

  • Mathematica
    First[RealDigits[N[(2-E*Log[2])/4,87]]]
Showing 1-2 of 2 results.