OFFSET
3,1
COMMENTS
a(3n-1) = A000567(n). - Peter Kagey, Dec 16 2016
a(n) is divisible by n-1 for all n due to the anagram property: n and 2n are congruent modulo n-1. - Peter Kagey, Dec 23 2016
LINKS
Mathematics Stack Exchange, Lower Bound for Anagram Sequence.
MATHEMATICA
Table[k = 1; While[! MatchQ @@ Map[Sort@ IntegerDigits[#, n] &, k {1, 2}], k++]; k, {n, 3, 30}] (* Michael De Vlieger, Dec 17 2016 *)
PROG
(PARI) a(n) = {my(k=1); while (vecsort(digits(k, n)) != vecsort(digits(2*k, n)), k++); k; } \\ Michel Marcus, Dec 17 2016
CROSSREFS
KEYWORD
nonn,base
AUTHOR
STATUS
approved