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.

A356082 Matula-Goebel number of the complete binary tree of n levels.

Original entry on oeis.org

1, 4, 49, 51529, 400034745289, 135016053798647886015597889
Offset: 1

Views

Author

Kevin Ryde, Jul 26 2022

Keywords

Comments

An estimate for a(7) is 7.304058*10^55. - Hugo Pfoertner, Jul 26 2022

Examples

			For n=3, the complete binary tree of 3 levels is
        49
      /    \     a(3) = prime(4)^2
    4       4         = 49
   / \     / \
  1   1   1   1
		

Crossrefs

Cf. A006894 (Colijn-Plazzotta), A084107 (balanced binary).
Cf. A356083 (ternary), A356084 (quaternary).

Programs

  • PARI
    a(n) = my(ret=1); for(i=2,n, ret=prime(ret)^2); ret;

Formula

a(n) = prime(a(n-1))^2, for n>=2.

Extensions

a(6) from Rémy Sigrist, Jul 26 2022

A356083 Matula-Goebel number of the complete ternary tree of n levels.

Original entry on oeis.org

1, 8, 6859, 328951971956791, 1658040970678649782777422161327743110829397625479
Offset: 1

Views

Author

Kevin Ryde, Jul 27 2022

Keywords

Examples

			For n=3, the complete ternary tree of 3 levels is
         6859
      /   |   \     a(3) = prime(8)^3
    8     8     8        = 6859
   /|\   /|\   /|\
  1 1 1 1 1 1 1 1 1
		

Crossrefs

Cf. A007097, A356082 (binary), A356084 (quaternary).

Programs

  • PARI
    a(n) = my(ret=1); for(i=2,n, ret=prime(ret)^3); ret;

Formula

a(n) = prime(a(n-1))^3, for n>=2.

Extensions

a(5) from Jinyuan Wang, Jul 27 2022
Showing 1-2 of 2 results.