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.
%I A205956 #15 Jul 13 2013 12:04:21 %S A205956 3,7,13,19,31,37,41,43,47,61,67,71,73,79,97,139,313,347,349,367,373, %T A205956 379,397,419,439,461,463,467,479,613,619,673,719,739,919,941,947,967, %U A205956 971,3413,3461,3463,3467,3469,3613,3671,3673,3719,3739,3919,3943,3947 %N A205956 Distinct primes occurring as not necessarily consecutive subsequences in decimal representation of 39467139. %C A205956 39467139 is the smallest number containing exactly 100 primes: A094535(100) = 39467139, A039995(39467139) = 100; 39467139 itself is not prime: 39467139 = 3*53*89*2789. %H A205956 Reinhard Zumkeller, <a href="/A205956/b205956.txt">Table of n, a(n) for n = 1..100</a> (full sequence) %e A205956 a(10) = 61 <- ___6_1__; %e A205956 a(20) = 367 <- 3__67___; %e A205956 a(30) = 613 <- ___6_13_; %e A205956 a(40) = 3413 <- 3_4__13_; %e A205956 a(50) = 3919 <- 39___1_9; %e A205956 a(60) = 9419 <- _94__1_9; %e A205956 a(70) = 9719 <- _9__71_9; %e A205956 a(80) = 39439 <- 394___39; %e A205956 a(90) = 346139 <- 3_46_139; %e A205956 a(100) = 3946139 <- 3946_139. %o A205956 (Haskell) %o A205956 import Data.List (subsequences, nub, sort) %o A205956 a205956 n = a205956_list !! (n-1) %o A205956 a205956_list = sort $ filter ((== 1) . a010051) $ %o A205956 nub $ map read (tail $ subsequences "39467139") %Y A205956 Cf. A010051. %K A205956 nonn,base,fini,full %O A205956 1,1 %A A205956 _Reinhard Zumkeller_, Feb 02 2012