login
A366948
Lexicographically earliest sequence of distinct terms > 0 such that any digit d jumping to the right over d digits lands on a Fibonacci digit.
7
1, 2, 3, 4, 5, 6, 8, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 9, 22, 23, 25, 28, 30, 31, 32, 24, 33, 26, 35, 27, 38, 50, 29, 40, 34, 51, 52, 53, 36, 55, 37, 39, 58, 54, 41, 80, 81, 82, 42, 83, 85, 43, 44, 45, 48, 88, 60, 56, 46, 100, 101, 102, 47, 57, 61, 62, 103, 59, 105, 63, 49, 65, 108, 64
OFFSET
1,2
COMMENTS
The Fibonacci digits are 0, 1, 2, 3, 5 and 8. This is not a permutation of the natural numbers as 104 and 106 cannot be part of the sequence, for instance.
EXAMPLE
a(1) = 1 jumps over 1 digit and lands on 3, a Fibonacci digit;
a(2) = 2 jumps over 2 digits and lands on 5, a Fibonacci digit;
a(4) = 4 jumps over 4 digits and lands on the 1 of 10, a Fibonacci digit;
a(9) = 10: the 1 of 10 jumps over 1 digit and lands on the first 1 of 11, a Fibonacci digit;
a(9) = 10: the 0 of 10 jumps over 0 digit and lands on the same Fibonacci digit; etc.
KEYWORD
base,nonn
AUTHOR
STATUS
approved