login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140716 Blocky integers, i.e., integers m > 1 such that there is a run of m consecutive integer squares the average of which is a square. 1

%I #41 Aug 31 2022 14:31:44

%S 7,25,31,49,55,73,79,97,103,121,127,145,151,169,175,193,199,217,223,

%T 241,247,265,271,289,295,313,319,337,343,361,367,385,391,409,415,433,

%U 439,457,463,481,487,505,511,529,535,553,559,577,583

%N Blocky integers, i.e., integers m > 1 such that there is a run of m consecutive integer squares the average of which is a square.

%C For a blocky m, a starting k^2 in the required run of squares is obtained by taking k = a - b - (m-1)/2, where a*b = (m^2 - 1)/48.

%C Positive integers k such that hypergeometric([k/8, (8-k)/8], [1/2], 3/4) = 2*cos(Pi/4). - _Artur Jasinski_, Oct 30 2008

%C Numbers > 1 that are congruent to {1, 7} mod 24. - _David Lovler_, Aug 10 2022

%H David Lovler, <a href="/A140716/b140716.txt">Table of n, a(n) for n = 1..10000</a>

%H S. Marivani and others, <a href="http://www.jstor.org/stable/27642547">Problem 11227: Consecutive Squares with a Square Average</a>, Amer. Math. Monthly, 115, No. 6, 2008, 568-569.

%H <a href="/index/Rec#order_03">Index entries for linear recurrences with constant coefficients</a>, signature (1,1,-1).

%F n is blocky if and only if n>1 and n (mod 24) = 1 or -1 or 7 or -7.

%F a(n) = 8*(s-1)+1 for n odd, a(n) = 8*(s-1)+7 for n even. - _Artur Jasinski_, Oct 30 2008

%F From _R. J. Mathar_, Nov 25 2008: (Start)

%F G.f.: x*(7+18*x-x^2)/((1+x)*(1-x)^2).

%F a(n) = a(n-2) + 24 = 12n - 2 + 3*(-1)^n. (End)

%F a(n) = a(n-1) + a(n-2) - a(n-3). - _Colin Barker_, May 12 2012

%F E.g.f.: (12*x - 2)*exp(x) + 3*exp(-x) - 1. - _David Lovler_, Aug 09 2022

%F Sum_{n>=1} (-1)^(n+1)/a(n) = 1 - (1+sqrt(2)/2)*Pi/12 - arccoth(sqrt(3))/(2*sqrt(3)) - arcsinh(sqrt(2))/(2*sqrt(6)). - _Amiram Eldar_, Aug 23 2022

%e 7 is blocky because ((-3)^2 + (-2)^2 + (-1)^2 + 0^2 + 1^2 + 2^2 + 3^2)/7 = 28/7 = 4 = 2^2.

%p a:=proc(n) if `mod`(n,24)=1 or `mod`(n,24)=-1 or `mod`(n,24)=7 or `mod`(n,24) =-7 then n else end if end proc: seq(a(n),n=2..600);

%t Table[12*n - 2 + 3*(-1)^n, {n, 1, 50}] (* _Vaclav Kotesovec_, Nov 14 2017 *)

%o (PARI) a(n) = 12*n - 2 + 3*(-1)^n \\ _David Lovler_, Aug 09 2022

%Y Cf. A146502-A146522. - _Artur Jasinski_, Oct 30 2008

%K nonn,easy

%O 1,1

%A _Emeric Deutsch_, Jun 04 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 10:01 EDT 2024. Contains 371967 sequences. (Running on oeis4.)