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

A231933 Terms of A231932 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 10, 1, 9, 81, 11, 2, 18, 82, 20, 3, 12, 28, 84, 27, 90, 30, 4, 13, 37, 85, 36, 94, 22, 38, 92, 19, 83, 99, 163, 171, 729, 86, 14, 5, 23, 47, 95, 32, 48, 93, 21, 29, 100, 24, 6, 15, 55, 87, 54, 96, 33, 57, 109, 31, 39, 112, 120, 256, 280, 336, 352, 732, 91, 16, 7, 25
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231931 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231921, A231923, A231925, A231927, A231929, A231931, A228407, A231932.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 9], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 9]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]

A231921 Terms of A231920 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 4, 1, 3, 9, 5, 2, 6, 10, 8, 12, 20, 24, 27, 11, 7, 13, 17, 23, 25, 28, 14, 16, 18, 22, 26, 29, 15, 19, 21, 31, 35, 37, 39, 47, 51, 59, 61, 65, 69, 73, 75, 81, 30, 36, 40, 44, 50, 52, 56, 60, 68, 70, 72, 76, 80, 82, 32, 34, 38, 42, 46, 48, 54, 58, 62, 64, 66, 74, 78
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231920 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231923, A231925, A231927, A231929, A231931, A231933, A228407, A231920.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 3], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 3]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 100, 0]

A231923 Terms of A231922 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231922 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231921, A231925, A231927, A231929, A231931, A231933, A228407, A231922.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 4], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 4]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]

A231925 Terms of A231924 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 6, 1, 5, 25, 7, 2, 10, 26, 12, 3, 8, 16, 28, 15, 30, 18, 4, 9, 21, 29, 20, 34, 14, 22, 32, 11, 27, 35, 51, 55, 125, 31, 24, 33, 13, 17, 36, 50, 56, 62, 68, 74, 88, 92, 114, 122, 126, 37, 43, 49, 57, 61, 83, 91, 109, 121, 127, 38, 42, 58, 66, 82, 86, 128, 40, 76, 80
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231924 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231921, A231923, A231927, A231929, A231931, A231933, A228407, A231924.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 5], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 5]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]

A231927 Terms of A231926 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 7, 1, 6, 36, 8, 2, 12, 37, 14, 3, 9, 19, 39, 18, 42, 21, 4, 10, 25, 40, 24, 46, 16, 26, 44, 13, 38, 48, 73, 78, 216, 41, 11, 5, 17, 32, 47, 23, 33, 45, 15, 20, 49, 28, 35, 43, 31, 50, 57, 64, 71, 80, 85, 117, 127, 154, 169, 191, 211, 217, 55, 22, 27, 58, 63, 118, 133
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231926 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231921, A231923, A231925, A231929, A231931, A231933, A228407, A231926.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 6], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 6]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]

A231928 Working in base 7: a(0)=0, thereafter a(n+1) is the smallest number not already in the sequence such that the bits of a(n) and a(n+1) together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 11, 1, 10, 100, 12, 2, 20, 101, 22, 3, 13, 31, 103, 30, 110, 33, 4, 14, 41, 104, 40, 114, 24, 42, 112, 21, 102, 120, 201, 210, 1000, 105, 15, 5, 25, 52, 115, 35, 53, 113, 23, 32, 121, 26, 6, 16, 61, 106, 60, 116, 36, 63, 131, 34, 43, 134, 143, 314, 341, 413, 431, 1003
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

This is a permutation of the nonnegative integers in base 7 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231920, A231922, A231924, A231926, A231930, A231932, A228407, A231929.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 7], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 7]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]; FromDigits@# & /@ IntegerDigits[s, 7]

A231931 Terms of A231930 written in base 10: the binary expansions of a(n) and a(n+1) taken together can be rearranged to form a palindrome.

Original entry on oeis.org

0, 9, 1, 8, 64, 10, 2, 16, 65, 18, 3, 11, 25, 67, 24, 72, 27, 4, 12, 33, 68, 32, 76, 20, 34, 74, 17, 66, 80, 129, 136, 512, 69, 13, 5, 21, 42, 77, 29, 43, 75, 19, 26, 81, 22, 6, 14, 49, 70, 48, 78, 30, 51, 89, 28, 35, 92, 99, 204, 225, 267, 281, 515, 73, 15, 7, 23, 58
Offset: 0

Views

Author

N. J. A. Sloane and Robert G. Wilson v, Nov 15 2013

Keywords

Comments

See A231930 for precise definition.
This is a permutation of the nonnegative integers - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230892, A231921, A231923, A231925, A231927, A231929, A231933, A228407, A231930.

Programs

  • Mathematica
    a[0] = 0; a[n_] := a[n] = Block[{k = 1, idm = IntegerDigits[ a[n - 1], 8], t = a@# & /@ Range[n - 1]}, Label[ start]; While[ MemberQ[t, k], k++];  While[ Select[ Permutations[ Join[ idm, IntegerDigits[k, 8]]], #[[1]] != 0 && # == Reverse@# &] == {}, k++; Goto[ start]]; k]; s = Array[a, 60, 0]
Showing 1-7 of 7 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.