|
Search: id:A094357
|
|
|
| A094357 |
|
Numbers of the form k^2 -1 such that every partial product is also of the form k^2-1. |
|
+0
4
|
|
| 3, 8, 15, 323, 115599, 13441619843, 180680260779332208399
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
Next term <= 32645356640144805339103579127542660095683 : The number (sqrt( product( a[j], j=1 .. n )+1)-1)^2-1 does satisfy the requirements for the next term, but is this always the smallest solution ? - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), May 15 2007
|
|
FORMULA
|
a(n+1) = A084702(A093959(n)-1). - David Wasserman (dwasserm(AT)earthlink.net), May 03 2007
For n>1, a[n+1] <= floor( sqrt( product( a[j], j=1 .. n )))^2-1 - M. F. Hasler (Maximilian.Hasler(AT)gmail.com), May 15 2007
|
|
EXAMPLE
|
3, 8 and 15 are 1 less than a square and so are the numbers 3, 3*8, 3*8*15.
|
|
CROSSREFS
|
Cf. A084702, A093959.
Sequence in context: A151397 A065500 A120341 this_sequence A136532 A030417 A123979
Adjacent sequences: A094354 A094355 A094356 this_sequence A094358 A094359 A094360
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), May 22 2004
|
|
EXTENSIONS
|
More terms from David Wasserman (dwasserm(AT)earthlink.net), May 03 2007
|
|
|
Search completed in 0.002 seconds
|
