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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #15 Nov 21 2013 12:50:18
%S 11,14,19,41,44,49,91,94,99,116,125,136,149,161,169,181,251,254,259,
%T 361,364,369,416,425,436,449,464,481,491,494,499,641,644,649,811,814,
%U 819,916,925,936,949,964,981,1001,1004,1009,1100,1121,1144,1169,1196,1211
%N Numbers that are the concatenation of exactly one pair of nonzero squares.
%C Subsequence of A191933; A193095(a(n)) = 1.
%H Reinhard Zumkeller, <a href="/A193097/b193097.txt">Table of n, a(n) for n = 1..10000</a>
%e 161 = concat(4^2,1^2), therefore 161 is a term;
%e 164 = concat(1^2,8^2) = concat(4^2,2^2), therefore 164 is not a term (A191933(15)=A192993(1)=164, A193095(164)=2).
%t Take[Union[FromDigits[Flatten[IntegerDigits/@((#)^2)]]&/@Tuples[Range[14],2]],60] (* _Harvey P. Dale_, Jul 27 2011 *)
%o (Haskell)
%o import Data.List (elemIndices)
%o a193097 n = a193097_list !! (n-1)
%o a193097_list = elemIndices 1 $ map a193095 [0..]
%K nonn,base
%O 1,1
%A _Reinhard Zumkeller_, Jul 17 2011