OFFSET
1,3
COMMENTS
Each term occurs at most twice, and it is a plausible conjecture that every term will occur exactly twice.
A257478(n) = distance of positions of first and second occurrence of n.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..25000
PROG
(Haskell)
a256918 n = a257218_list !! (n-1)
a256918_list = zipWith gcd a257218_list $ tail a257218_list
CROSSREFS
KEYWORD
nonn
AUTHOR
Reinhard Zumkeller, Apr 25 2015
STATUS
approved