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.

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]

A231920 Working in base 3: 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, 110, 202, 220, 1000, 102, 21, 111, 122, 212, 221, 1001, 112, 121, 200, 211, 222, 1002, 120, 201, 210, 1011, 1022, 1101, 1110, 1202, 1220, 2012, 2021, 2102, 2120, 2201, 2210, 10000, 1010, 1100, 1111, 1122, 1212, 1221, 2002, 2020
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 3 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231922, A231924, A231926, A231928, A231930, A231932, A228407, A231921.

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, 60, 0]; FromDigits@# & /@ IntegerDigits[s, 3]

A231922 Working in base 4: 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, 111, 21, 102, 120, 201, 210, 1000, 122, 133, 212, 221, 313, 331, 1001, 112, 23, 32, 113, 131, 223, 232, 300, 311, 322, 333, 1003, 123, 132, 213, 231, 312, 321, 1002, 121, 200, 211, 222, 233, 323, 332
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 4 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231920, A231924, A231926, A231928, A231930, A231932, A228407, A231923.

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]; FromDigits@# & /@ IntegerDigits[s, 4]

A231926 Working in base 6: 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, 44, 55, 111, 51, 122, 133, 144, 155, 212, 221, 313, 331, 414, 441, 515, 551, 1001
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 6 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231920, A231922, A231924, A231928, A231930, A231932, A228407, A231927.

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]; FromDigits@# & /@ IntegerDigits[s, 6]

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]

A231930 Working in base 8: 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 8 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231920, A231922, A231924, A231926, A231928, A231932, A228407, A231931.

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]; FromDigits@# & /@ IntegerDigits[s, 8]

A231932 Working in base 9: 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 9 - see the Comments in A228407 for the proof.

Crossrefs

Cf. A230891, A231920, A231922, A231924, A231926, A231928, A231930, A228407, A231933.

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]; FromDigits@# & /@ IntegerDigits[s, 9]
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.