A068952 Squares in A068949.
1, 4, 9, 16, 36, 49, 64, 81, 100, 121, 144, 196
Offset: 1
Examples
a(4)=16 since the fourth square in A068949 is 16.
Extensions
a(12) from Giovanni Resta, Jun 27 2018
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.
a(4)=16 since the fourth square in A068949 is 16.
a(4)=43 since the fourth prime in A068949 is 43.
disum(n)= { local(resul) ; resul=0 ; while(n>0, resul += n%10 ; n = (n-n%10)/10 ; ) ; return(resul) ; }
A069324(maxs)= { local(ssqu,su) ; su=1 ; for(s=1,maxs, ssqu=s^2 ; if (disum(ssqu) > su, su=disum(ssqu) ; if( isprime(su), print1(su,",") ; ) ; ) ; ) ; }
A069324(200000000) ; \\ R. J. Mathar, May 19 2006
A007953 := proc(n) option remember: return add(d, d=convert(n, base, 10)): end: A068947 := proc(n) option remember: local k, p: if(n=1)then return 1: fi: k:=procname(n-1): p:=A007953(k^2): do k:=k+1: if(A007953(k^2)>p)then return k: fi: od: end: seq(A068947(n)^2, n=1..20); # Nathaniel Johnston, May 04 2011
t = {}; s = 0; Do[If[(x = Total[IntegerDigits[y = n^2]]) > s, AppendTo[t, y]; s = x], {n, 150000}]; t (* Jayanta Basu, Aug 06 2013 *)
13^2 = 169 = A068809(5), so a(5)=13.
A007953 := proc(n) option remember: return add(d, d=convert(n, base, 10)): end: A068947 := proc(n) option remember: local k,p: if(n=1)then return 1: fi: k:=procname(n-1): p:=A007953(k^2): do k:=k+1: if(A007953(k^2)>p)then return k: fi: od: end: seq(A068947(n),n=1..20); # Nathaniel Johnston, May 04 2011
a(4)=4 since A068809(4)=49 and so 4+9=13 and 1+3=4.
Comments