Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130283
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130283 Integers n>0 for which A130280(n)=0, i.e. such that there is no integer m>1 for which n(m^2-1)+1 is a square. +0
5
4, 9, 25, 49, 81, 121, 169, 289, 361, 441 (list; graph; listen)
OFFSET

1,1

COMMENT

Are there terms > 4 in this sequence which are not odd squares (cf. A130284)?

EXAMPLE

a(1)=4 since 1(2^2-1)+1=2^2, 2(5^2-1)+1=7^2, 3(3^2-1)+1=5^2 but 4(m^2-1)+1 = 4m^2-3 can't be a square because the largest square < 4m^2 is (2m-1)^2 = 4m^2-4m+1 < 4m^2-3 for m>1.

a(2)=9 since for n=5,6,7,8 one has m=2,3,5,2, but 9(m^2-1)+1 = 9m^2-8 > 9m^2-11 >= 9m^2-6m+1 = (3m-1)^2 and therefore can't be a square.

CROSSREFS

Cf. A084702, A130280, A130284, A130288.

Adjacent sequences: A130280 A130281 A130282 this_sequence A130284 A130285 A130286

Sequence in context: A082200 A063482 A069557 this_sequence A065739 A053704 A082180

KEYWORD

nonn

AUTHOR

M. F. Hasler (Maximilian.Hasler(AT)gmail.com), May 24 2007

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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research