login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080809 a(1) = 6; thereafter, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1). 5

%I #12 Aug 07 2015 03:15:16

%S 6,16,216,2085136,62019685191371643,

%T 82626753081964483505319130781618465733184

%N a(1) = 6; thereafter, a(n)= smallest n-th power obtained by inserting digits anywhere in a(n-1).

%F a(n)=A080514(n), n>1. - _R. J. Mathar_, Sep 18 2008

%p 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: A080809 := 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 :=6 ; for n from 2 to 15 do an := A080809(an,n) ; end ; # _R. J. Mathar_, Sep 20 2006

%Y Cf. A080804, A080805, A080806, A080807, A080808, A080810, A080811, A080812.

%K nonn,base

%O 1,1

%A _Amarnath Murthy_, Mar 22 2003

%E More terms from _R. J. Mathar_, Sep 20 2006

%E Copied a term from A080514. - _Sean A. Irvine_, Sep 01 2009

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 7 20:21 EDT 2024. Contains 375749 sequences. (Running on oeis4.)