OFFSET
1,1
COMMENTS
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..100 (full sequence)
EXAMPLE
a(10) = 61 <- ___6_1__;
a(20) = 367 <- 3__67___;
a(30) = 613 <- ___6_13_;
a(40) = 3413 <- 3_4__13_;
a(50) = 3919 <- 39___1_9;
a(60) = 9419 <- _94__1_9;
a(70) = 9719 <- _9__71_9;
a(80) = 39439 <- 394___39;
a(90) = 346139 <- 3_46_139;
a(100) = 3946139 <- 3946_139.
PROG
(Haskell)
import Data.List (subsequences, nub, sort)
a205956 n = a205956_list !! (n-1)
a205956_list = sort $ filter ((== 1) . a010051) $
nub $ map read (tail $ subsequences "39467139")
CROSSREFS
KEYWORD
nonn,base,fini,full
AUTHOR
Reinhard Zumkeller, Feb 02 2012
STATUS
approved