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

A179844 a(n) = A179752(A080068(n)).

Original entry on oeis.org

1, 1, 2, 2, 3, 2, 3, 3, 3, 3, 4, 4, 4, 4, 3, 4, 6, 6, 5, 4, 5, 6, 7, 7, 6, 6, 6, 7, 8, 6, 6, 6, 6, 5, 7, 8, 8, 7, 7, 8, 9, 8, 5, 6, 9, 11, 10, 8, 6, 7, 9, 10, 9, 9, 10, 12, 9, 9, 9, 10, 9, 10, 12, 12, 13, 10, 8, 10, 10, 11, 11, 11, 12, 14, 14, 9, 7, 8, 10, 11, 13, 13, 14, 15, 14, 13, 11, 10
Offset: 1

Views

Author

Antti Karttunen, Aug 03 2010

Keywords

Comments

a(n) is also the local maximum of A179759 in range [(2*A000217(n-1))+1,2*A000217(n)].

Crossrefs

A179847 a(n) = A179752(A179756(n)).

Original entry on oeis.org

3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 5, 5, 5, 5, 4, 6, 6, 5, 4, 9, 9, 7, 7, 8, 8, 5, 7, 7, 7, 7, 8, 8, 7, 7, 11, 11, 10, 10, 10, 10, 12, 12, 10, 10, 11, 11, 11, 11, 10, 10, 9, 10, 11, 11, 11, 12, 12, 12, 11, 11, 12, 12, 14, 14, 11, 11, 13, 13, 11, 11, 13, 15, 15, 14, 17, 17, 16, 16, 14, 14
Offset: 1

Views

Author

Antti Karttunen, Aug 03 2010

Keywords

Comments

a(n) is also the local maximum of A179766 in range [(2*A000217(n+1))-5,(2*A000217(n+2))-6].

Crossrefs

Cf. also A179843 & A179844-A179846.

A179845 a(n) = A179752(A122241(n)).

Original entry on oeis.org

1, 4, 3, 3, 4, 4, 4, 4, 5, 5, 4, 4, 6, 5, 5, 4, 8, 6, 5, 6, 7, 9, 6, 7, 7, 8, 6, 7, 8, 8, 8, 7, 10, 7, 8, 7, 11, 7, 10, 10, 10, 8, 12, 9, 10, 9, 11, 10, 11, 11, 10, 9, 12, 11, 11, 11, 11, 12, 12, 11, 11, 10, 13, 9, 14, 10, 13, 12, 13, 14, 11, 10, 17, 15, 14, 13, 17, 13, 16, 14, 14, 14
Offset: 1

Views

Author

Antti Karttunen, Aug 03 2010

Keywords

Comments

a(n) is also the local maximum of A179764 in range [(2*A000217(n+1))-5,(2*A000217(n+2))-6].

Crossrefs

Cf. also A179841 & A179844-A179847.

A179846 a(n) = A179752(A122244(n)).

Original entry on oeis.org

2, 3, 3, 4, 3, 4, 4, 4, 4, 5, 5, 5, 5, 5, 6, 5, 4, 6, 9, 5, 7, 9, 8, 7, 5, 8, 6, 7, 7, 8, 7, 7, 8, 11, 7, 10, 11, 10, 10, 12, 10, 10, 12, 11, 10, 11, 11, 10, 11, 8, 10, 11, 11, 11, 12, 12, 11, 12, 12, 12, 11, 14, 12, 11, 14, 13, 11, 11, 13, 13, 15, 14, 13, 17, 14, 16, 17, 13, 16, 14
Offset: 1

Views

Author

Antti Karttunen, Aug 03 2010

Keywords

Comments

a(n) is also the local maximum of A179765 in range [(2*A000217(n+1))-5,(2*A000217(n+2))-6].

Crossrefs

Cf. also A179842 & A179844-A179847.

A179751 Maximum depth/height of binary trees encoded by A014486.

Original entry on oeis.org

0, 1, 2, 2, 3, 3, 2, 3, 3, 4, 4, 3, 4, 4, 3, 3, 3, 4, 4, 3, 3, 4, 4, 5, 5, 4, 5, 5, 4, 4, 4, 5, 5, 4, 4, 5, 5, 4, 4, 3, 4, 4, 3, 3, 4, 5, 5, 4, 4, 5, 5, 3, 3, 3, 4, 4, 4, 4, 5, 5, 4, 4, 4, 5, 5, 6, 6, 5, 6, 6, 5, 5, 5, 6, 6, 5, 5, 6, 6, 5, 5, 4, 5, 5, 4, 4, 5, 6, 6, 5, 5, 6, 6, 4, 4, 4, 5, 5, 5, 5, 6, 6
Offset: 0

Views

Author

Antti Karttunen, Aug 03 2010

Keywords

Comments

Each integer n appears first at position given by A014137.

Examples

			The terms A014486[1..8] encode the following rooted plane binary trees:
.1.......2.......3.......4.......5........6.......7.......8..
...........................\/....\/...............\/....\/...
..........\/....\/........\/......\/....\/ \/....\/......\/..
.\/......\/......\/......\/......\/......\_/......\/......\/.
thus a(1)=1, a(2)=2, a(3)=2, a(4)=3, a(5)=3, a(6)=2, a(7)=3, a(8)=3.
		

Crossrefs

Cf. A179752.
Showing 1-5 of 5 results.