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.

A349945 Number of ways to write n as a^4 + b^2 + (c^4 + d^2)/5 with a,b,c,d nonnegative integers.

Original entry on oeis.org

1, 3, 4, 3, 3, 6, 7, 3, 1, 4, 5, 4, 2, 3, 8, 5, 3, 9, 10, 6, 7, 11, 10, 3, 2, 6, 8, 9, 3, 9, 16, 5, 4, 11, 9, 7, 9, 9, 12, 7, 2, 8, 11, 7, 2, 11, 14, 4, 3, 10, 10, 9, 8, 9, 21, 9, 3, 9, 5, 7, 4, 10, 17, 8, 3, 15, 15, 9, 9, 16, 20, 5, 3, 5, 7, 11, 3, 11, 18, 4, 6, 22, 18, 11, 14, 15, 19, 10, 2, 9, 16, 10, 3, 9, 16, 11, 7, 19, 16, 13, 12
Offset: 0

Views

Author

Zhi-Wei Sun, Dec 06 2021

Keywords

Comments

Conjecture 1: a(n) > 0 for all n >= 0, and a(n) = 1 only for n = 0, 2^(4*k+3) (k = 0,1,2,...).
This has been verified for all n <= 10^5.
Conjecture 2: Each n = 0,1,2,... can be written as a*x^4 + b*y^2 + (c*z^4 + w^2)/5 with x,y,z,w nonnegative integers, provided that (a,b,c) is among the four triples (1,2,4), (2,1,1), (6,1,1), (6,1,6).
See also A349942 for a similar conjecture.
Via a computer search, we have found many tuples (a,b,c,d,m) of positive integers (such as (1,1,4,2,3), (4,1,1,2,3) and (1,1,19,1,4900)) for which we guess that each n = 0,1,2,... can be written as a*x^4 + b*y^2 + (c*z^4 + d*w^2)/m with x,y,z,w nonnegative integers.

Examples

			a(8) = 1 with 8 = 0^4 + 2^2 + (2^4 + 2^2)/5.
		

Crossrefs

Programs

  • Mathematica
    SQ[n_]:=SQ[n]=IntegerQ[Sqrt[n]];
    tab={};Do[r=0;Do[If[SQ[5(n-x^4-y^2)-z^4],r=r+1],{x,0,n^(1/4)},{y,0,Sqrt[n-x^4]},{z,0,(5(n-x^4-y^2))^(1/4)}];tab=Append[tab,r],{n,0,100}];Print[tab]