login
The OEIS is supported by
the many generous donors to the OEIS Foundation
.
Hints
(Greetings from
The On-Line Encyclopedia of Integer Sequences
!)
A181643
a(n) is the smallest value such that a(n)*[a(n)+n]*[a(n)+n+n]=y^2 is a perfect square
1
0, 0, 0, 0, 40, 6, 18, 0, 0, 0, 0, 0, 0, 4, 10, 0, 0, 0, 0, 5, 7, 0, 0, 1, 0, 0, 0, 72, 0, 15, 0, 0, 0, 128, 0, 0, 0, 0, 936, 0, 800, 0, 0, 0, 360, 196, 0, 0, 0, 0, 0, 0, 0, 54
(
list
;
graph
;
refs
;
listen
;
history
;
text
;
internal format
)
OFFSET
1,5
COMMENTS
For a given n there is more than one solution.
LINKS
Table of n, a(n) for n=1..54.
EXAMPLE
a(5)=40 since 40*(40+5)*(40+5+5)=40*45*50=90000=300^2
CROSSREFS
Cf.
A115878
,
A181646
.
Sequence in context:
A078084
A037937
A126652
*
A117831
A152143
A277874
Adjacent sequences:
A181640
A181641
A181642
*
A181644
A181645
A181646
KEYWORD
nonn
AUTHOR
Carmine Suriano
, Nov 03 2010, corrected Nov 10 2010
STATUS
approved
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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)