This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
import Data.List (elemIndex); import Data.Maybe (fromJust) a258335 = (+ 1) . fromJust . (`elemIndex` a258334_list)
a258225 = flip div 3 . a258083
lista(nn) = {v = []; vs = vecsort(v); for (n=1, nn, k=3; pt = 10^(#digits(n)); while (! (((k % pt) == n) && !vecsearch(vs, k)), k+=3); v = concat(v, k); vs = vecsort(v); print1(k/3, ", "););} \\ Michel Marcus, Jun 26 2015
a258329 = flip div 7 . a258188
import Data.List (isPrefixOf, delete)
a258217 n = a258217_list !! (n-1)
a258217_list = f 1 $ tail $ zip a008589_list $ map show a008589_list where
f x ws = g ws where
g ((u, vs) : uvs) = if isPrefixOf (show x) vs
then u : f (x + 1) (delete (u, vs) ws) else g uvs
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 *)
Comments