cp's OEIS Frontend

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.

A080811 a(1) = 8, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).

Original entry on oeis.org

8, 81, 68921, 671898241, 67499118303941862584001, 6576499147308118090309591239435044518621593475579845001
Offset: 1

Views

Author

Amarnath Murthy, Mar 22 2003

Keywords

Crossrefs

Programs

  • Maple
    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

Extensions

2 more terms from R. J. Mathar, Sep 20 2006
One more term. Sean A. Irvine, Aug 31 2009