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.

A356334 a(n) is the number of nonnegative integer solutions (x; y) with x <= y of x^(n+1) + y^(n+1) = (x+y)^n.

Original entry on oeis.org

1, 3, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3
Offset: 0

Views

Author

Reiner Moewald, Aug 04 2022

Keywords

Comments

Conjecture: a(n) = 3 except for n = 0 or n = 2. - Chai Wah Wu, Sep 21 2022

Examples

			For n=2, the 4 solutions are (0; 0), (0; 1), (1; 2) and (2; 2). The pairs (0; 0), (0; 1) and (2^(n-1); 2^(n-1)) exist for all n > 0.
		

Programs

  • Python
    def A356334(n): return sum(1 for x in range((1<Chai Wah Wu, Sep 19 2022

Extensions

a(11)-a(14) from Hugo Pfoertner, Sep 18 2022
a(15)-a(20) from Chai Wah Wu, Sep 21 2022