

A329248


Lexicographically earliest sequence S of distinct terms such that a(n) is divisible by the last odd digit of S, with a(1) = 1.


1



1, 2, 3, 6, 9, 18, 4, 5, 10, 7, 14, 8, 11, 12, 13, 15, 20, 25, 30, 21, 16, 17, 28, 35, 40, 45, 50, 55, 60, 65, 70, 42, 49, 27, 56, 75, 80, 85, 90, 36, 24, 33, 39, 54, 95, 100, 19, 63, 48, 51, 22, 23, 57, 77, 84, 91, 26, 29, 72, 98, 81, 31, 32, 66, 69, 99, 108, 34, 78, 105, 110, 37, 112, 38, 87, 119, 117, 126, 41, 43, 93, 96
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

This is a permutation of the integers > 0.


LINKS



EXAMPLE

The sequence S starts with 1,2,3,6,9,18,4,5,10,7,14,8,11,...
a(1) = 1 by construction.
a(2) = 2 as 2 is the smallest available integer divisible by 1 (this 1 being the last odd digit of S).
a(3) = 3 as 3 is the smallest available integer divisible by 1 (this 1 being the last odd digit of S).
a(4) = 6 as 6 is the smallest available integer divisible by 3 (this 3 being the last odd digit of S).
a(5) = 9 as 9 is the smallest available integer divisible by 3 (this 3 being the last odd digit of S).
a(6) = 18 as 18 is the smallest available integer divisible by 9 (this 9 being the last odd digit of S).
a(7) = 4 as 4 is the smallest available integer divisible by 1 (this 1 being the last odd digit of S).
a(8) = 5 as 5 is the smallest available integer divisible by 1 (this 1 being the last odd digit of S).
a(9) = 10 as 10 is the smallest available integer divisible by 5 (this 5 being the last odd digit of S).
...


CROSSREFS



KEYWORD

base,nonn


AUTHOR



STATUS

approved



