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.

A295006 Numbers n such that the largest digit of n^2 is 6.

This page as a plain text file.
%I A295006 #15 Mar 30 2024 09:35:39
%S A295006 4,6,8,16,19,25,34,40,46,51,56,58,60,66,68,75,79,80,81,106,108,116,
%T A295006 119,121,125,129,142,146,156,160,162,175,190,204,206,208,215,216,225,
%U A295006 231,238,245,246,248,249,250,251,252,254,255,256,258,325,334,340,354,355,369,375,379
%N A295006 Numbers n such that the largest digit of n^2 is 6.
%H A295006 Harvey P. Dale, <a href="/A295006/b295006.txt">Table of n, a(n) for n = 1..1000</a>
%F A295006 a(n) = sqrt(A295016(n)), where sqrt = A000196 or A000194 or A003059.
%e A295006 19 is in this sequence because 19^2 = 361 has 6 as largest digit.
%t A295006 Select[Range[400],Max[IntegerDigits[#^2]]==6&] (* _Harvey P. Dale_, Mar 30 2024 *)
%o A295006 (PARI) select( is_A295006(n)=n&&vecmax(digits(n^2))==6 , [0..999]) \\ The "n&&" avoids an error message for n=0.
%Y A295006 Cf. A295016 (the corresponding squares), A277959, A277960, A277961, A295005 .. A295009 (analog for digits 2 through 9), A294996 (analog for cubes).
%Y A295006 Cf. A000290 (the squares).
%K A295006 nonn,base
%O A295006 1,1
%A A295006 _M. F. Hasler_, Nov 12 2017