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.

A153752 Numbers k such that there are 16 digits in k^2 and for each factor f of 16 (1,2,4,8) the sum of digit groupings of size f is a square.

This page as a plain text file.
%I A153752 #22 May 09 2021 07:53:26
%S A153752 31883334,31886667,31956690,31970049,32469999,33338100,33341067,
%T A153752 33870000,34140000,34149999,34713042,34763334,34856667,35780000,
%U A153752 36356249,36356480,36359065,37523635,37737452,37949451,38362409
%N A153752 Numbers k such that there are 16 digits in k^2 and for each factor f of 16 (1,2,4,8) the sum of digit groupings of size f is a square.
%C A153752 This sequence is a subsequence of both A153745 and A061910.
%C A153752 This sequence contains 124 terms, with a(124) = 9998956. - _Giovanni Resta_, Jun 06 2015
%H A153752 Giovanni Resta, <a href="/A153752/b153752.txt">Table of n, a(n) for n = 1..124</a> (all terms)
%e A153752 31883334^2 = 1016546986955556;
%e A153752 1+0+1+6+5+4+6+9+8+6+9+5+5+5+5+6 = 81 = 9^2;
%e A153752 10+16+54+69+86+95+55+56 = 441 = 21^2;
%e A153752 1016+5469+8695+5556 = 20736 = 144^2;
%e A153752 10165469+86955556 = 97121025 = 9855^2.
%t A153752 okQ[n_]:=Module[{n2=IntegerDigits[n^2]},And@@(IntegerQ[Sqrt[ #]]&/@ (Total/@(Table[ FromDigits/@Partition[n2,2^i],{i,0,3}])))]; Select[ Range[31622777,38400000],okQ] (* _Harvey P. Dale_, Aug 12 2012 *)
%Y A153752 Cf. A004159, A061910, A153745.
%K A153752 nonn,base,fini,full
%O A153752 1,1
%A A153752 _Doug Bell_, Dec 31 2008