Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #25 Dec 23 2024 14:53:44
%S 14,21,35,42,56,63,7,84,91,105,112,126,133,140,154,161,175,182,196,
%T 203,210,224,231,245,252,266,273,28,294,301,315,322,336,343,350,364,
%U 371,385,392,406,413,420,434,441,455,462,476,483,49,504,511,525,532,546
%N Smallest multiple of 7 starting with n, that did not appear earlier.
%C The sequence is a permutation of the positive multiples of 7. - _Vladimir Shevelev_, May 24 2015
%C A258334(n) = a(n) / 7 is a permutation of the positive integers. - _Reinhard Zumkeller_, May 27 2015
%H Reinhard Zumkeller, <a href="/A258217/b258217.txt">Table of n, a(n) for n = 1..10000</a>
%H Éric Angelini, <a href="https://web.archive.org/web/*/http://list.seqfan.eu/oldermail/seqfan/2015-May/014898.html">Multiples of 3 ending with n</a>, SeqFan list, May 23 2015.
%t a[1] = 14; a[n_] := a[n] = For[dn = IntegerDigits[n]; k = 7, True, k = k+7, dk = IntegerDigits[k]; lg = Min[Length[dn], Length[dk]]; If[Union[ Take[dk, lg] - Take[dn, lg]] == {0} && FreeQ[Array[a, n-1], k], Return[k]]]; Array[a, 54] (* _Jean-François Alcover_, Feb 09 2018 *)
%o (Haskell)
%o import Data.List (isPrefixOf, delete)
%o a258217 n = a258217_list !! (n-1)
%o a258217_list = f 1 $ tail $ zip a008589_list $ map show a008589_list where
%o f x ws = g ws where
%o g ((u, vs) : uvs) = if isPrefixOf (show x) vs
%o then u : f (x + 1) (delete (u, vs) ws) else g uvs
%Y Cf. A008589, A258188, A258083, A258334.
%K nonn,base,changed
%O 1,1
%A _Eric Angelini_ and _Reinhard Zumkeller_, May 23 2015