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.

A096602 Integer permutation induced by (A096603, A096604).

Original entry on oeis.org

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

Views

Author

Reinhard Zumkeller, Jun 30 2004

Keywords

Comments

a(A096603(n))=A096604(n) and a(A096604(n))=A096603(n);
a(a(n)) = n; a(n) <> n.

Links

A096605 a(n) = floor((floor(n/2) + a(floor(n/2)))/2), a(1) = 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 2, 2, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 11, 11, 11, 11, 12, 12, 13, 13, 13, 13, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 18, 18, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 22, 22, 23, 23, 23, 23, 24, 24, 25, 25, 25, 25
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2004

Keywords

Comments

a(2*n+1)=a(2*n), A096607(n)=a(2*n);
for n>9: floor(n/a(n))=3; A096606(n)=A002264(n-1)-a(n).

Crossrefs

Cf. A096603, A096603.

A096607 a(n) = A096605(2*n).

Original entry on oeis.org

1, 1, 2, 2, 3, 4, 4, 5, 5, 6, 7, 8, 8, 9, 9, 10, 11, 11, 12, 13, 13, 14, 15, 16, 16, 17, 17, 18, 19, 19, 20, 21, 21, 22, 23, 23, 24, 25, 25, 26, 27, 27, 28, 29, 29, 30, 31, 32, 32, 33, 33, 34, 35, 35, 36, 37, 37, 38, 39, 39, 40, 41, 41, 42, 43, 43, 44, 45, 45, 46, 47, 47, 48, 49
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2004

Keywords

Crossrefs

Cf. A096603, A096603.

A096604 Numbers that appear at most once in A096607.

Original entry on oeis.org

3, 6, 7, 10, 12, 14, 15, 18, 20, 22, 24, 26, 28, 30, 31, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 63, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122, 124, 126, 127, 130
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 30 2004

Keywords

Comments

a(n) occurs at most twice in A096605;
complement of A096603, a and A096603 are disjoint;
A096602(a(n)) = A096603(n).
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.