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

A072757 Complement of A072756.

Original entry on oeis.org

3, 6, 7, 12, 13, 15, 16, 21, 25, 27, 28, 30, 33, 34, 36, 39, 43, 46, 48, 52, 55, 57, 60, 61, 63, 66, 67, 70, 73, 75, 76, 79, 81, 84, 87, 88, 93, 96, 97, 102, 103, 106, 108, 111, 115, 117, 120, 123, 124, 127, 129, 133, 135, 136, 138, 141, 142, 147, 148, 150, 151, 156
Offset: 0

Views

Author

Clark Kimberling, Jul 09 2002

Keywords

Crossrefs

Seems to be A026344(n+1) + 1.

A104463 Complement of {A072756(n): n>=2}.

Original entry on oeis.org

0, 1, 3, 6, 7, 12, 13, 15, 16, 21, 25, 27, 28, 30, 33, 34, 36, 39, 43, 46, 48, 52, 55, 57, 60, 61, 63, 66, 67, 70, 73, 75, 76, 79, 81, 84, 87, 88, 93, 96, 97, 102, 103, 106, 108, 111, 115, 117, 120, 123, 124, 127, 129, 133, 135, 136, 138, 141, 142, 147, 148, 150, 151
Offset: 0

Views

Author

Clark Kimberling, Mar 08 2005

Keywords

Examples

			The sequences a(n)=A072756(n) and b(n)=A104463(n) are jointly defined:
a(n) = least positive integer not a(k) + Floor(a(k)/2) for k<n. Thus
a(0)=0, b(0)=0, a(1)=1, b(1)=1, a(2)=2, b(2)=3, a(3)=4, b(4)=6,...
		

Crossrefs

Formula

A104463(n)=s(n)+Floor(s(n)/2), where s(n)=A072756(n).
a(n)=A072757(n-2), n>1. [From R. J. Mathar, Aug 28 2008]

A104464 Permutation of natural numbers based on A072756 and A104463.

Original entry on oeis.org

1, 2, 3, 4, 6, 5, 7, 8, 12, 9, 13, 10, 15, 11, 16, 14, 21, 17, 25, 18, 27, 19, 28, 20, 30, 22, 33, 23, 34, 24, 36, 26, 39, 29, 43, 31, 46, 32, 48, 35, 52, 37, 55, 38, 57, 40, 60, 41, 61, 42, 63, 44, 66, 45, 67, 47, 70, 49, 73, 50, 75, 51, 76, 53, 79, 54, 81, 56, 84, 58, 87, 59
Offset: 1

Views

Author

Clark Kimberling, Mar 08 2005

Keywords

Comments

Apparently a(n) = A072758(n). - R. J. Mathar, Jul 09 2011

Crossrefs

Formula

Let b(n)=A072756(n) and c(n)=A104463(n). Then this sequence is given by c(1), b(2), c(2), b(3), c(3), b(4), c(4), ...

A072758 a(0)=0, a(1)=1 and for k>1, a(2k)=least positive integer not a(j) for j<2k; and a(2k+1)=a(2k)+Floor(a(2k)/2).

Original entry on oeis.org

0, 1, 2, 3, 4, 6, 5, 7, 8, 12, 9, 13, 10, 15, 11, 16, 14, 21, 17, 25, 18, 27, 19, 28, 20, 30, 22, 33, 23, 34, 24, 36, 26, 39, 29, 43, 31, 46, 32, 48, 35, 52, 37, 55, 38, 57, 40, 60, 41, 61, 42, 63, 44, 66, 45, 67, 47, 70, 49, 73, 50, 75, 51, 76, 53, 79, 54, 81, 56, 84, 58, 87
Offset: 0

Views

Author

Clark Kimberling, Jul 09 2002

Keywords

Comments

A permutation of the nonnegative integers; a(2n)=A072756(n+1), a(2n+1)=A072757(n-1) for n>=1.

Crossrefs

Showing 1-4 of 4 results.