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.
%I A357474 #20 Nov 19 2022 03:28:30 %S A357474 1,4,9,11,14,16,19,25,36,41,44,49,64,81,91,94,99,100,111,114,116,119, %T A357474 121,125,136,141,144,149,161,164,169,181,191,194,196,199,225,251,254, %U A357474 256,259,289,324,361,364,369,400,411,414,416,419,425,436,441,444,449,464 %N A357474 Squarely correct numbers. %C A357474 A positive integer is a squarely correct number if its base-10 representation consists entirely of one or more adjacent blocks of digits that are positive perfect squares with no leading zeros. (See George Berzsenyi link below.) %H A357474 George Berzsenyi, <a href="https://doi.org/10.1080/10724117.2022.2092341">Consecutively and Squarely Correct (P439)</a>, Math Horizons, Vol. 30, Issue 1, The Playground, August 2022. %F A357474 5n/3 < a(n) << n^k for n > 1, where k = log 10/log 3 = 2.0959.... - _Charles R Greathouse IV_, Oct 03 2022 %e A357474 14401 is not a term, but 14411 is. %o A357474 (Python) %o A357474 from sympy.ntheory.primetest import is_square %o A357474 def ok(n): %o A357474 if is_square(n): return True %o A357474 s = str(n) %o A357474 return any(s[i]!="0" and ok(int(s[:i])) and ok(int(s[i:])) for i in range(1, len(s))) %o A357474 print([k for k in range(1, 465) if ok(k)]) # _Michael S. Branicky_, Oct 03 2022 %o A357474 (PARI) is(n)=if(n<11, issquare(n), n%10, my(d=digits(n)); for(i=1,#d, if(issquare(n%10^i) && d[#d+1-i] && is(n\10^i), return(1))); 0, my(k=valuation(n,10)); k%2==0 && is(n/10^k)) \\ _Charles R Greathouse IV_, Oct 04 2022 %Y A357474 Cf. A000290, A036435, A018851. %K A357474 nonn,easy,base %O A357474 1,2 %A A357474 _Freddy Barrera_, Sep 29 2022