|
%I #63 Feb 16 2023 05:08:10
%S 1,81,121,361,441,841,961,1521,1681,2401,2601,3481,3721,4761,5041,
%T 6241,6561,7921,8281,9801,10201,11881,12321,14161,14641,16641,17161,
%U 19321,19881,22201,22801,25281,25921,28561,29241,32041,32761,35721,36481,39601,40401
%N Squares ending in digit 1.
%C Intersection of A000290 and A017281; also, union of A017282 and A017378. The square roots are in A017281 or in A017377 (numbers ending in 1 or 9, respectively). - _David A. Corneth_, May 22 2016
%H Seiichi Manyama, <a href="/A273372/b273372.txt">Table of n, a(n) for n = 1..10000</a>
%H <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).
%F G.f.: x*(1 + 80*x + 38*x^2 + 80*x^3 + x^4) / ((1 + x)^2*(1 - x)^3).
%F a(n) = 10*A132356(n-1) + 1 = 5*(10*n+(-1)^n-5)*(2*n+(-1)^n-1)/4+1.
%F a(n) = (5*n - 5/2 + (3/2)*(-1)^n)^2 = 25*n^2 - 25*n + 17/2 + 15*n*(-1)^n - (15/2)*(-1)^n. - _David A. Corneth_, May 21 2016
%F a(n) = A090771(n)^2. - _Michel Marcus_, May 25 2016
%F Sum_{n>=1} 1/a(n) = Pi^2*(3+sqrt(5))/50. - _Amiram Eldar_, Feb 16 2023
%t Table[5 (10 n + (-1)^n - 5) (2 n + (-1)^n - 1)/4 + 1, {n, 1, 50}]
%o (Magma) /* By definition: */ [n^2: n in [0..200] | Modexp(n,2,10) eq 1];
%o (Magma) [5*(10*n+(-1)^n-5)*(2*n+(-1)^n-1)/4+1: n in [1..50]];
%o (Ruby) p (1..(n + 1) / 2).inject([]){|s, i| s + [(10 * i - 9) ** 2, (10 * i - 1) ** 2]}[0..n - 1] # Seiichi Manyama, May 24 2016
%o (Python)
%o A273372_list = [(10*n+m)**2 for n in range(10**3) for m in (1,9)] # _Chai Wah Wu_, May 24 2016
%Y Cf. A000290, A090771, A132356.
%Y Cf. A017281 (numbers ending in 1), A017283 (cubes ending in 1).
%Y Cf. similar sequences listed in A273373.
%K nonn,base,easy
%O 1,2
%A _Vincenzo Librandi_, May 21 2016
%E Edited by _Bruno Berselli_, May 24 2016
|
