A362076 -id:A362076 - cp's OEIS frontend

A362075 a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-2) + a(n-1).

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

Offset: 1

Scott R. Shannon, Apr 08 2023

The sequence is likely to be finite although it contains at least 100000 terms.

Sequence is finite with 4128755 terms, since a(4128754) = 46946449 and a(4128755) = 777000707 have sum 823947156. - Michael S. Branicky, Apr 08 2023

			a(10) = 20 as a(8) + a(9) = 8 + 9 = 17, and 20 is the smallest unused number that does not contain the digits 1 or 7.

Michael S. Branicky, Table of n, a(n) for n = 1..10000
Michael S. Branicky, Python program
Scott R. Shannon, Image of the first 100000 terms. The green line is a(n) = n.

Cf. A362076, A342441, A342442, A067581, A297065.

# see linked program that generates the full sequence

A362093 a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-1) - a(n-2).

Original entry on oeis.org

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

Offset: 1

Scott R. Shannon, Apr 08 2023

nonn

The sequence is likely to be finite although it contains at least 1 million terms.

Sequence is finite with 6080472 terms, since a(6080471) = 660606060 and a(6080472) = 8822811 have difference -651783249. - Michael S. Branicky, Apr 09 2023

			a(11) = 22 as a(10) - a(9) = 20 - 9 = 11, and 22 is the smallest unused number that does not contain the digit 1.

Michael S. Branicky, Python program
Scott R. Shannon, Image of the first 1 million terms. The green line is a(n) = n.

Cf. A362075, A362076, A342441, A342442, A067581, A297065.

# see link for program that generates full sequence

cp's OEIS Frontend

A362075 a(1) = 1, a(2) = 2; for n > 2, a(n) is the least positive integer not occurring earlier such that a(n) shares no digit with a(n-2) + a(n-1).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Python