A081511 Duplicate of A030283.
0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 22, 30, 41, 50, 61, 70, 81, 90, 111, 200, 311, 400, 511, 600
Offset: 0
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 (intersect)
a030284 n = a030284_list !! (n-1)
a030284_list = f [] a000040_list where
f xs (p:ps) = if null $ intersect xs ys then p : f ys ps else f xs ps
where ys = show p
-- Reinhard Zumkeller, Sep 21 2013
ta={1};Do[s1=IntegerDigits[Part[ta, Length[ta]]]; s2=IntegerDigits[Prime[n]];If[Equal[Intersection[s1, s2], {}], Print[{Prime[n], Prime[n+1]}];ta=Append[ta, Prime[n]]], {n, 1, 1000000}];ta=Delete[ta, 1] (* Labos Elemer, Nov 18 2004 *)
import Data.List (intersect)
a229364 n = a229364_list !! (n-1)
a229364_list = f "" [1, 3 ..] where
f xs (o:os) = if null $ intersect xs ys then o : f ys os else f xs os
where ys = show o
Comments