A333406 Lexicographically earliest sequence of positive distinct integers such that if a(n) climbs over a(n) commas to the right, it is met by a term whose leftmost digit is nonprime.

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

Offset

1,2

Comments

This is conjectured to be a permutation of the positive integers.

Links

Carole Dubois, Table of n, a(n) for n = 1..5000

Example

a(1) = 1 climbs over 1 comma and is met by the nonprime digit 4;
a(2) = 4 climbs over 4 commas and is met by the nonprime digit 8;
a(3) = 2 climbs over 2 commas and is met by the nonprime digit 6;
a(4) = 3 climbs over 3 commas and is met by the nonprime digit 9;
a(5) = 6 climbs over 6 commas and is met by the nonprime digit 1 (of "11"); etc.

Crossrefs

Cf. A333404 (same idea, but the leftmost digit of the target is prime).

Sequence in context: A241051 A275590 A338844 * A083181 A134074 A010315

Adjacent sequences: A333403 A333404 A333405 * A333407 A333408 A333409

Keyword

base,nonn

Author

Eric Angelini and Carole Dubois, Mar 19 2020

Status

approved