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.

A341162 Computing a(n) modulo (digit sum of a(n)) for the successive terms of the sequence results in a sequence that has the same succession of digits as this one.

Original entry on oeis.org

11, 13, 17, 15, 41, 29, 43, 38, 14, 56, 16, 19, 25, 23, 31, 28, 91, 44, 53, 34, 97, 46, 101, 57, 22, 55, 26, 33, 35, 68, 74, 69, 106, 64, 89, 61, 39, 47, 92, 93, 37, 104, 58, 49, 79, 71, 32, 67, 124, 125, 82, 62, 51, 52, 59, 137, 66, 88, 77, 116, 83, 99, 65, 96, 134, 151, 118, 109, 136, 98, 119, 154, 85, 129, 86
Offset: 1

Views

Author

Eric Angelini and Carole Dubois, Feb 06 2021

Keywords

Comments

This is the lexicographically earliest sequence of distinct terms > 0 with this property.

Examples

			............n:  1   2   3   4   5   6   7   8 ...
.........a(n): 11, 13, 17, 15, 41, 29, 43, 38
Digitsum (DS):  2   4   8   6   5  11   7  11
..a(n) mod DS:  1   1   1   3   1   7   1   5 <- same dig. succ. as the sequence.
		

Crossrefs