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

A190131 Inverse permutation to A190130.

Original entry on oeis.org

1, 4682, 7076, 7661, 8246, 8831, 9416, 2, 587, 1172, 1757, 2342, 2927, 3512, 4097, 4683, 5268, 5853, 6438, 6784, 6857, 6930, 7003, 7077, 7150, 7223, 7296, 7369, 7442, 7515, 7588, 7662, 7735, 7808, 7881, 7954, 8027, 8100, 8173, 8247, 8320, 8393, 8466, 8539
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

a(A190128(n)) = A190128(a(n)) = n.

Links

Programs

  • Haskell
    import Data.List (elemIndex)
import Data.Maybe (fromJust)
a190131 n = a190131_list !! (n-1)
a190131_list =
   map (succ . fromJust . (`elemIndex` a190130_list)) [1..10000]

A190016 Numbers 1 through 10000 sorted lexicographically in decimal representation.

Original entry on oeis.org

1, 10, 100, 1000, 10000, 1001, 1002, 1003, 1004, 1005, 1006, 1007, 1008, 1009, 101, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 102, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 103, 1030, 1031, 1032, 1033, 1034, 1035, 1036
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

A190017 = inverse permutation: a(A190017(n)) = A190017(a(n)) = n;
there are 11 fixed points: {1,9980,9981,9982,9983,9984,9985,9986,9987,9988,9989}.

Examples

			a(13) = 1008;
a(14) = 1009;
a(15) = 101;
a(16) = 1010;
a(17) = 1011;
largest term a(5) = 10000;
last term a(10000) = 9999, largest term lexicographically.

Links

Crossrefs

Cf. A119589 (same for 1..100); A190126 (base 2), A190128 (base 3), A190130 (base 8), A190132 (base 12), A190134 (base 16).

Programs

  • Haskell
    import Data.Ord (comparing)
import Data.List (sortBy)
a190016 n = a190016_list !! (n-1)
a190016_list = sortBy (comparing show) [1..10000]
  • PARI
    eval(Set(vector(10^4,n,Str(n)))) \\ M. F. Hasler, Oct 25 2019

A190128 Numbers 1 through 10000 sorted lexicographically in ternary representation.

Original entry on oeis.org

1, 3, 9, 27, 81, 243, 729, 2187, 6561, 6562, 6563, 2188, 6564, 6565, 6566, 2189, 6567, 6568, 6569, 730, 2190, 6570, 6571, 6572, 2191, 6573, 6574, 6575, 2192, 6576, 6577, 6578, 731, 2193, 6579, 6580, 6581, 2194, 6582, 6583, 6584, 2195, 6585, 6586, 6587, 244
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

A190129 = inverse permutation: a(A190129(n)) = A190129(a(n)) = n;
a(n) <> n for n > 1.

Examples

			a(12) = 2188 -> 10000001  [tern];
a(13) = 6564 -> 100000010 [tern];
a(14) = 6565 -> 100000011 [tern];
a(15) = 6566 -> 100000012 [tern];
a(16) = 2189 -> 10000002  [tern];
a(17) = 6567 -> 100000020 [tern];
a(18) = 6568 -> 100000021 [tern];
a(19) = 6569 -> 100000022 [tern];
a(20) =  730 -> 1000001   [tern];
a(21) = 2190 -> 10000010  [tern];
largest term a(5164) = 10000 -> 111201101 [tern];
last term a(10000) = 6560 -> 22222222 [tern], largest term lexicographically.

Links

Crossrefs

Cf. A007089; A190126 (base 2), A190130 (base 8), A190016 (base 10), A190132 (base 12), A190134 (base 16).

Programs

  • Haskell
    import Data.Ord (comparing)
import Data.List (sortBy)
a190128 n = a190128_list !! (n-1)
a190128_list = sortBy (comparing (show . a007089)) [1..10000]

A190126 Numbers 1 through 10000 sorted lexicographically in binary representation.

Original entry on oeis.org

1, 2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096, 8192, 8193, 4097, 8194, 8195, 2049, 4098, 8196, 8197, 4099, 8198, 8199, 1025, 2050, 4100, 8200, 8201, 4101, 8202, 8203, 2051, 4102, 8204, 8205, 4103, 8206, 8207, 513, 1026, 2052, 4104, 8208, 8209, 4105
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

A190127 = inverse permutation: a(A190127(n)) = A190127(a(n)) = n;
a(n) <> n for n > 2.

Examples

			a(13) = 4096 -> 1000000000000  [bin];
a(14) = 8192 -> 10000000000000 [bin];
a(15) = 8193 -> 10000000000001 [bin];
a(16) = 4097 -> 1000000000001  [bin];
a(17) = 8194 -> 10000000000010 [bin];
a(18) = 8195 -> 10000000000011 [bin];
a(19) = 2049 -> 100000000001   [bin];
a(20) = 4098 -> 1000000000010  [bin];
largest term a(3626) = 10000 -> 10011100010000 [bin];
last term a(10000) = 8191 -> 1111111111111 [bin], largest term lexicographically.

Links

Crossrefs

Cf. A007088; A190128 (base 3), A190130 (base 8), A190016 (base 10), A190132 (base 12), A190134 (base 16).

Programs

  • Haskell
    import Data.Ord (comparing)
import Data.List (sortBy)
a190126 n = a190126_list !! (n-1)
a190126_list = sortBy (comparing (show . a007088)) [1..10000]

A190132 Numbers 1 through 10000 sorted lexicographically in duodecimal representation (base 12).

Original entry on oeis.org

1, 12, 144, 1728, 1729, 1730, 1731, 1732, 1733, 1734, 1735, 1736, 1737, 1738, 1739, 145, 1740, 1741, 1742, 1743, 1744, 1745, 1746, 1747, 1748, 1749, 1750, 1751, 146, 1752, 1753, 1754, 1755, 1756, 1757, 1758, 1759, 1760, 1761, 1762, 1763, 147, 1764, 1765
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

A190133 = inverse permutation: a(A190133(n)) = A190133(a(n)) = n;
a(n) <> n for n > 1.

Examples

			a(13) = 1737 -> 1009 [doz];
a(14) = 1738 -> 100A [doz];
a(15) = 1739 -> 100B [doz];
a(16) =  145 -> 101  [doz];
a(17) = 1740 -> 1010 [doz];
a(18) = 1741 -> 1011 [doz];
largest term a(9026) = 10000 -> 5282 [doz];
last term a(10000) = 1727 -> BBB [doz], largest term lexicographically.

Links

Crossrefs

Cf. A190126 (base 2), A190128 (base 3), A190130 (base 8), A190016 (base 10), A190134 (base 16).

Programs

  • Haskell
    import Data.Ord (comparing)
import Data.List (sortBy)
import Numeric (showIntAtBase)
import Data.Char (intToDigit)
a190132 n = a190132_list !! (n-1)
a190132_list =
   sortBy (comparing (flip (showIntAtBase 12 intToDigit) "")) [1..10000]

A190134 Numbers 1 through 10000 sorted lexicographically in hexadecimal representation (base 16).

Original entry on oeis.org

1, 16, 256, 4096, 4097, 4098, 4099, 4100, 4101, 4102, 4103, 4104, 4105, 4106, 4107, 4108, 4109, 4110, 4111, 257, 4112, 4113, 4114, 4115, 4116, 4117, 4118, 4119, 4120, 4121, 4122, 4123, 4124, 4125, 4126, 4127, 258, 4128, 4129, 4130, 4131, 4132, 4133, 4134
Offset: 1

Views

Author

Reinhard Zumkeller, May 06 2011

Keywords

Comments

A190135 = inverse permutation: a(A190135(n)) = A190135(a(n)) = n;
a(n) <> n for n > 1.

Examples

			a(17) = 4109 -> 100D [hex];
a(18) = 4110 -> 100E [hex];
a(19) = 4111 -> 100F [hex];
a(20) =  257 -> 101  [hex];
a(21) = 4112 -> 1010 [hex];
a(22) = 4113 -> 1011 [hex];
largest term a(6301) = 10000 -> 2710 [hex];
last term a(10000) = 4095 -> FFF [hex], largest term lexicographically.

Links

Crossrefs

Cf. A190126 (base 2), A190128 (base 3), A190130 (base 8), A190016 (base 10), A190132 (base 12).

Programs

  • Haskell
    import Data.Ord (comparing)
import Data.List (sortBy)
import Numeric (showHex)
a190134 n = a190134_list !! (n-1)
a190134_list = sortBy (comparing (flip showHex "")) [1..10000]
Showing 1-6 of 6 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.