A257277 -id:A257277 - cp's OEIS frontend

A257276 Inverse permutation of A257277 (least unused number having a digit that divides the previous term).

0, 1, 3, 6, 13, 11, 16, 9, 27, 31, 2, 4, 5, 7, 8, 10, 12, 14, 15, 17, 24, 18, 25, 19, 26, 28, 37, 30, 38, 32, 23, 20, 36, 41, 39, 29, 42, 43, 48, 53, 47, 21, 40, 50, 57, 58, 66, 45, 69, 59, 64, 22, 49, 54, 65, 81, 70, 60, 71, 62, 80, 33, 67, 61, 74, 82, 95, 92, 75, 96, 101, 34, 68, 84, 76, 83, 102

Offset: 0

M. F. Hasler, May 07 2015

Cf. A257277.

vecsort(A257277,,1)[1..200] \\ assuming A257277 is defined as vector with enough (nonzero) terms of that sequence.

A278649 Lexicographically earliest sequence of distinct terms such that, for any n>0, a(n+1) has a digit that divides a(n) and a(n) has a digit that divides a(n+1).

Original entry on oeis.org

1, 10, 2, 12, 3, 15, 5, 25, 14, 7, 21, 11, 13, 16, 4, 20, 18, 6, 24, 8, 32, 22, 26, 28, 34, 27, 30, 33, 36, 9, 63, 39, 51, 17, 19, 31, 41, 61, 71, 81, 23, 100, 29, 102, 35, 45, 50, 55, 65, 54, 52, 40, 44, 48, 56, 42, 38, 72, 46, 92, 62, 82, 104, 43, 105, 37

Offset: 1

Rémy Sigrist, Nov 25 2016

This sequence combines the constraints met in A218468 and in A257277.

Rémy Sigrist, Table of n, a(n) for n = 1..10000
Rémy Sigrist, PARI program for A278649

Cf. A218468, A257277.

a = {1}; Do[k = 2; While[Or[Nand[AnyTrue[#2, Divisible[a[[n - 1]], #] &],
AnyTrue[#1, Divisible[k, #] &]], MemberQ[a, k]] & @@ Map[DeleteCases[ IntegerDigits@ #, 0] &, {a[[n - 1]], k}], k++]; AppendTo[a, k], {n, 2, 66}]; a (* Michael De Vlieger, Nov 25 2016, Version 10 *)

cp's OEIS Frontend

A257276 Inverse permutation of A257277 (least unused number having a digit that divides the previous term).

Views

Author

Keywords

Crossrefs

Programs

PARI

A278649 Lexicographically earliest sequence of distinct terms such that, for any n>0, a(n+1) has a digit that divides a(n) and a(n) has a digit that divides a(n+1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica