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

A084108 A014486-indices of "Complete Binary Trees".

Original entry on oeis.org

0, 1, 6, 477, 11231586, 17656351387745509, 118547604486270210927391203275078974, 14557702344245589436016960628730576845591277100880695377777962217288601549
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Comments

Fixed points of permutations A069767 and A069768.

Crossrefs

a(n) = A057117(A083942(n)). Also iterates of A080298, i.e., a(1)=A080298(0), a(2)=A080298(A080298(0)), a(3)=A080298(A080298(A080298(0))), etc. Cf. also A083940, A080274.

Formula

a(n) = A080300(A084107(n)).

A083938 A014486-indices of binary trees whose left and right subtree are identical.

Original entry on oeis.org

0, 1, 6, 42, 52, 385, 414, 477, 506, 555, 4089, 4180, 4388, 4479, 4645, 5095, 5186, 5394, 5485, 5651, 5969, 6060, 6226, 6502, 47363, 47661, 48366, 48664, 49237, 50800, 51098, 51803, 52101, 52674, 53808, 54106, 54679, 55681, 59311, 59609, 60314
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Comments

Fixed points of permutation A069770. Diagonal of A072764 (and A072766).

Crossrefs

a(n) = A080300(A083939(n)). Cf. A083940.

Formula

a(0)=0, a(n)=A072764bi(n-1, n-1).

A083941 A014486-encoding of symmetric binary trees.

Original entry on oeis.org

0, 2, 50, 844, 906, 13624, 13876, 14642, 14892, 15402, 218352, 219368, 222436, 223448, 225492, 234722, 235730, 238796, 239800, 241844, 246986, 247986, 250028, 254122, 3494880, 3498960, 3511240, 3515312, 3523496, 3560388, 3564452, 3576728
Offset: 0

Views

Author

Antti Karttunen, May 13 2003

Keywords

Crossrefs

Subsets: A084107, A080263, A080293.

Formula

a(n) = A014486(A083940(n)).
Showing 1-3 of 3 results.