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

A249648 Positions of terms in A249626, having a zero in their decimal representation.

Original entry on oeis.org

0, 10, 19, 27, 34, 40, 45, 49, 52, 54, 55, 72, 80, 87, 93, 98, 102, 105, 107, 108, 109, 118, 126, 133, 139, 144, 148, 151, 153, 154, 176, 183, 189, 194, 198, 201, 203, 204, 205, 213, 221, 222, 229, 235, 240, 244, 247, 249, 257, 276, 282, 287, 291, 294, 296
Offset: 1

Views

Author

Reinhard Zumkeller, Nov 03 2014

Keywords

Comments

A168046(A249626(a(n))) = 0.

Examples

			.       n | 1  2  3  4  5  6  7  8  9 10  11  12  13  14  15  16  17  18
. A249248 | 0 10 19 27 34 40 45 49 52 54  55  72  80  87  93  98 102 105
. A249626 | 0 10 20 30 40 50 60 70 80 90 100 101 102 103 104 105 106 107 .
		

Crossrefs

Programs

  • Haskell
    a249648 = fromJust . (`elemIndex` a249626_list) . a011540

A102823 "True already", base 10, start 0: a(n) is the least integer such that the sequence up to a(n-1) written in base 10 contains floor(a(n)/10) copies of the digit a(n) % 10, with a(0) = 0.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19, 20, 23, 24, 25, 26, 27, 28, 29, 30, 34, 35, 36, 37, 38, 39, 40, 45, 46, 47, 48, 49, 50, 56, 57, 58, 59, 60, 67, 68, 69, 70, 78, 79, 80, 89, 90, 100, 102, 103, 104, 105, 106, 107, 108, 109, 112, 113
Offset: 0

Views

Author

Hugo van der Sanden, Feb 26 2005

Keywords

Comments

a(n) = A249626(n) for n <= 55. - Reinhard Zumkeller, Nov 03 2014

Examples

			The first 11 values of the sequence written in decimal include 2 '1's and 1 '2', so the next value cannot be 11 (the count of '1's is not 1) but can be 12.
		

References

Crossrefs

Showing 1-2 of 2 results.