The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A277959 Numbers n such that 2 is the largest decimal digit of n^2. 15
 11, 101, 110, 149, 1001, 1010, 1011, 1100, 1101, 1490, 10001, 10010, 10011, 10100, 10110, 11000, 11001, 11010, 14499, 14900, 100001, 100010, 100011, 100100, 100101, 100110, 101000, 101001, 101100, 110000, 110001, 110010, 110100, 144990, 149000, 316261 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS The terms > 1 of A058411 can be considered as primitive elements of this sequence, obtained by multiplying those by powers of 10 (cf. formula). These terms of A058411 have at least 2 nonzero digits, and therefore their square has at least one digit 2. - M. F. Hasler, Nov 15 2017 LINKS M. F. Hasler, Table of n, a(n) for n = 1..1380 (first 50 terms from Colin Barker) FORMULA Equals (A058411 \ {1})*A011557, where A011557 = { 10^k; k >= 0 }. - M. F. Hasler, Nov 16 2017 MATHEMATICA Select[Range[4*10^5], And[#[] > 0, Union@ Take[RotateLeft[#, 2], 7] == {0}] &@ DigitCount[#^2] &] (* Michael De Vlieger, Nov 16 2017 *) PROG (PARI) L=List(); for(n=1, 10000, if(vecmax(digits(n^2))==2, listput(L, n))); Vec(L) (PARI) A277959(LIM=1e15, L=List(), N=1)={while(LIM>N=next_A058411(N), my(t=N); until(LIM

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 February 22 13:35 EST 2020. Contains 332136 sequences. (Running on oeis4.)