login

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”).

A258188
Smallest multiple of 7 not appearing earlier that ends with n.
4
21, 42, 63, 14, 35, 56, 7, 28, 49, 210, 511, 112, 413, 714, 315, 616, 217, 518, 119, 420, 721, 322, 623, 224, 525, 126, 427, 728, 329, 630, 231, 532, 133, 434, 735, 336, 637, 238, 539, 140, 441, 742, 343, 644, 245, 546, 147, 448, 749, 350, 651, 252, 553, 154
OFFSET
1,1
COMMENTS
a(10*n) = 10*a(n).
The sequence is a permutation of the positive multiples of 7. - Vladimir Shevelev, May 24 2015
A258329(n) = a(n) / 7 is a permutation of the positive integers. - Reinhard Zumkeller, May 27 2015
LINKS
MATHEMATICA
a[n_] := a[n] = For[k = 7, True, k = k + 7, If[Divisible[k - n, 10^IntegerLength[n]] && FreeQ[Array[a, n-1], k], Return[k]]]; Array[a, 54] (* Jean-François Alcover, Feb 07 2018 *)
PROG
(Haskell)
import Data.List (isPrefixOf, delete)
a258188 n = a258188_list !! (n-1)
a258188_list = f 1 $ tail $ zip
a008589_list $ map (reverse . show) a008589_list where
f x ws = g ws where
g ((u, vs) : uvs) = if isPrefixOf xs vs
then u : f (x + 1) (delete (u, vs) ws) else g uvs
xs = reverse $ show x
CROSSREFS
KEYWORD
nonn,base
AUTHOR
STATUS
approved