# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a246973 Showing 1-1 of 1 %I A246973 #25 Sep 08 2022 08:46:09 %S A246973 1,14,49,916,1625,2536,3649,4964,6481,81100,100121,121144,144169, %T A246973 169196,196225,225256,256289,289324,324361,361400,400441,441484, %U A246973 484529,529576,576625,625676,676729,729784,784841,841900,900961,9611024,10241089,10891156,11561225,12251296,12961369,13691444 %N A246973 n^2 concatenated with (n+1)^2. %H A246973 Vincenzo Librandi, Table of n, a(n) for n = 0..1000 %e A246973 a(2) = 49 because 2^2 = 4 and 3^2 = 9. %e A246973 a(3) = 916 because 3^2 = 9 and 4^2 = 16. %e A246973 a(4) = 1625 because 4^2 = 16 and 5^2 = 25. %p A246973 a:= n-> parse(cat(n^2, (n+1)^2)): %p A246973 seq(a(n), n=0..40); # _Alois P. Heinz_, May 27 2018 %t A246973 Table[FromDigits[Join[IntegerDigits[n^2], IntegerDigits[(n + 1)^2]]], {n, 0, 39}] (* _Alonso del Arte_, Sep 13 2014 *) %o A246973 (Magma) [1] cat [Seqint(Intseq(n^2+2*n+1) cat Intseq(n^2)): n in [1..50]]; // _Vincenzo Librandi_, Sep 13 2014 %o A246973 (PARI) a(n) = eval(Str(n^2,(n+1)^2)) \\ _Michel Marcus_, Sep 13 2014 and _M. F. Hasler_, May 27 2018 %o A246973 (PARI) A246973(n)=n^2*10^logint(10*(n+1)^2,10)+(n+1)^2 \\ Over 4 x faster than using eval(Str(...)). - _M. F. Hasler_, May 27 2018 %Y A246973 For primes see A104242. %Y A246973 Cf. A235497. %K A246973 nonn,base,easy %O A246973 0,2 %A A246973 _N. J. A. Sloane_, Sep 13 2014 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE