|
|
A274051
|
|
Extend S with the smallest integer a(n) not yet present in S such that a(n) divided by the first digit of a(n+1) has as remainder the last digit of a(n+1).
|
|
1
|
|
|
1, 10, 20, 32, 40, 31, 21, 30, 42, 52, 64, 54, 60, 50, 62, 76, 51, 43, 53, 41, 65, 72, 80, 73, 61, 75, 63, 70, 86, 95, 74, 82, 91, 83, 92, 71, 87, 96, 100, 84, 93, 85, 94, 110, 120, 130, 140, 150, 160, 97, 81, 90, 170, 98, 180, 190, 200, 210, 220, 230, 240, 250, 260, 270, 280, 290, 302, 312, 300, 310, 301, 201, 211
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
1 divided by 1 (the first digit of "10") leaves 0 (the last digit of "10").
10 divided by 2 (the first digit of "20") leaves 0 (the last digit of "20")
20 divided by 3 (the first digit of "32") leaves 2 (the last digit of "32")
32 divided by 4 (the first digit of "40") leaves 0 (the last digit of "40")
40 divided by 3 (the first digit of "31") leaves 1 (the last digit of "31")
|
|
LINKS
|
|
|
MATHEMATICA
|
S = {1}; Do[k = 10; While[Or[MemberQ[S, k], Mod[S[[n]], First@ #] != Last@ # &@ IntegerDigits@ k], k++]; AppendTo[S, k], {n, 73}]; S (* Michael De Vlieger, Jun 08 2016 *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|