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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A295007 Numbers n such that the largest digit of n^2 is 7. 2
 24, 26, 42, 52, 61, 69, 74, 76, 82, 84, 85, 88, 124, 131, 132, 144, 154, 165, 166, 174, 181, 189, 194, 218, 224, 226, 234, 239, 240, 260, 265, 266, 269, 271, 274, 275, 276, 319, 326, 356, 371, 376, 384, 415, 416, 418, 419, 420, 421, 448, 455, 466, 474, 476, 520, 521, 524, 525, 526, 552 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Robert Israel, Table of n, a(n) for n = 1..10000 FORMULA a(n) = sqrt(A295017(n)), where sqrt = A000196 or A000194 or A003059. EXAMPLE 24 is in this sequence because 24^2 = 576 has 7 as largest digit. MAPLE filter:= proc(n) max(convert(n^2, base, 10))=7 end proc: select(filter, [\$1..1000]); # Robert Israel, Feb 19 2019 PROG (PARI) select( is_A295007(n)=n&&vecmax(digits(n^2))==7 , [0..999]) \\ The "n&&" avoids an error message for n=0. CROSSREFS Cf. A295017 (the corresponding squares), A277959 .. A277961 (same for digit 2 .. 4), A295005 .. A295009 (same for digit 5 .. 9). Cf. A000290 (the squares). Sequence in context: A079720 A053680 A260251 * A053968 A336237 A058627 Adjacent sequences:  A295004 A295005 A295006 * A295008 A295009 A295010 KEYWORD nonn,base AUTHOR M. F. Hasler, Nov 12 2017 STATUS approved

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.

Last modified December 6 22:42 EST 2021. Contains 349567 sequences. (Running on oeis4.)