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.
buffedStr := proc(n,candid) local f ; if length(n) = 0 then RETURN(true) ; fi ; f := SearchText(substring(n,1),candid) ; if f = 0 then RETURN(false) ; else if buffedStr(substring(n,2..-1),substring(candid,f+1..-1)) = true then RETURN(true) ; else RETURN(false) ; fi ; fi ; end: A080811 := proc(preva,n) local i,tst ; i := 1 ; while true do tst := i^n ; if buffedStr(convert(preva,string),convert(tst,string)) = true then RETURN(tst) ; fi ; i := i+1 ; od: end: an :=8 ; for n from 2 to 15 do an := A080811(an,n) ; end ; # R. J. Mathar, Sep 20 2006
24^2=576. 26^3=17576. 196^4=1475789056. 67687^5=1420778345789277056227207.
buffedStr := proc(n,candid) local f ; if length(n) = 0 then RETURN(true) ; fi ; f := SearchText(substring(n,1),candid) ; if f = 0 then RETURN(false) ; else if buffedStr(substring(n,2..-1),substring(candid,f+1..-1)) = true then RETURN(true) ; else RETURN(false) ; fi ; fi ; end: A080810 := proc(preva,n) local i,tst ; i := 1 ; while true do tst := i^n ; if buffedStr(convert(preva,string),convert(tst,string)) = true then RETURN(tst) ; fi ; i := i+1 ; od: end: an :=7 ; for n from 2 to 15 do an := A080810(an,n) ; end ; # R. J. Mathar, Sep 20 2006
Comments