login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A061588 a(1) = 2, a(n) = number obtained by replacing each digit of a(n-1) with its square. 4

%I

%S 2,4,16,136,1936,181936,164181936,13616164181936,

%T 193613613616164181936,1819361936193613613616164181936,

%U 1641819361819361819361936193613613616164181936

%N a(1) = 2, a(n) = number obtained by replacing each digit of a(n-1) with its square.

%D William Davidson, Introducing the peculiar 'Davidson Sequence', MathFest 2012.

%H John Cerkan, <a href="/A061588/b061588.txt">Table of n, a(n) for n = 1..18</a>

%F From William Davidson, Aug 15 2012: (Start)

%F For integer n > 5,

%F a(n) = a(n-4)x10^(L(a(n-5))+L(a(n-1))) + a(n-5)x10^(L(a(n-1)))+a(n-1), where L(a(n)) is the number of digits in a(n).

%F L(a(n)) = (W^(n-1)*[s1]^T)^T*[d]^T, with the 5 x 5 square matrix W = [(0 1 0 0 0) (0 0 1 0 0) (0 0 0 1 0) (0 0 0 0 1) ( 1 1 0 0 1)], [s1] = [1 2 3 4 6], [d] = [1 0 0 0 0], and ^T is the transformation of a matrix.

%F To determine the starting integers of any a(n), for any integer n > 5, first let b = (((n + 2)mod(4)) + 2). Then using a(2), a(3), a(4), and a(5), any n > 5, a(n) begins with a(b). Let n = 100, b = 4, a(100) = 1936... (End)

%e After 136: the squares of 1, 3, 6 are 1, 9, 36 respectively hence the next term is 1936.

%e a(11)=a(7)*10^L(a(6)+a(10))+a(6)*10^L(a(10))+a(10)

%e =13616164181936*10^55 + 164181936*10^46 +

%e 1641819361819361819361936193613613616164181936

%e =136161641819361641819361641819361819361819361936193613613616164181936

%e a(100)=1936...*10^L(a(96)+a(99))+136...*10^L(a(99))+136...936, where L(100) has approximately 2.74*10^17 digits. - _William Davidson_, Aug 15 2012

%o (Python)

%o def digits(n):

%o .d=[]

%o .while n>0:

%o ..d.append(n%10)

%o ..n=n//10

%o .return d

%o def sqdig(n):

%o .new=0

%o .num=digits(n)

%o .spacing=0

%o .while num:

%o ..k=num.pop(0)

%o ..new+=(10**(spacing))*(k**2)

%o ..if k>3:

%o ...spacing+=1

%o ..spacing+=1

%o .return new

%o def davidson(n):

%o .i=2

%o .while n>1:

%o ..i=sqdig(i)

%o ..n-=1

%o .return i

%o # _David Nacin_, Aug 19 2012

%K nonn,easy,base

%O 1,1

%A _Amarnath Murthy_, May 13 2001

%E More terms from Larry Reeves (larryr(AT)acm.org) and Asher Natan Auel (auela(AT)reed.edu), May 15 2001. Corrected by _Matthew Vandermast_, Apr 23 2003

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 18 23:35 EDT 2021. Contains 348071 sequences. (Running on oeis4.)