Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A140716
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A140716 Blocky integers, i.e. integers n>1 such that there is a run of n consecutive integer squares the average of which is a square. +0
1
7, 25, 31, 49, 55, 73, 79, 97, 103, 121, 127, 145, 151, 169, 175, 193, 199, 217, 223, 241, 247, 265, 271, 289, 295, 313, 319, 337, 343, 361, 367, 385, 391, 409, 415, 433, 439, 457, 463, 481, 487, 505, 511, 529, 535, 553, 559, 577, 583 (list; graph; listen)
OFFSET

1,1

COMMENT

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

REFERENCES

S. Marivani and others, Problem 11227, Amer. Math. Monthly, 115, No. 6, 2008, 568-569.

FORMULA

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

EXAMPLE

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

MAPLE

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);

CROSSREFS

Sequence in context: A065660 A100496 A110081 this_sequence A141393 A075927 A119617

Adjacent sequences: A140713 A140714 A140715 this_sequence A140717 A140718 A140719

KEYWORD

nonn

AUTHOR

Emeric Deutsch (deutsch(AT)duke.poly.edu), Jun 04 2008

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research