[go: up one dir, main page]

login
Revision History for A127690 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
a(1)=3; for n>1, a(n) is such that a(1)^2+...+a(n)^2 = (1+a(n))^2.
(history; published version)
#13 by T. D. Noe at Sun Dec 08 12:42:44 EST 2013
COMMENTS

Define a "super-squared n-tuple" as an n-tuple in which the components are increasing and the sum of the squares of the first k components in the tuple is a perfect square, for all 1<=k<=n. Then this sequence gives the minimal sum of the components of a super-squared n-tuple. - Edward Jiang, Dec 4 2013

KEYWORD

nonn,changed

nonn

STATUS

proposed

approved

#12 by Edward Jiang at Wed Dec 04 20:15:58 EST 2013
STATUS

editing

proposed

Discussion
Sat Dec 07
14:30
T. D. Noe: Date is 04. But not sure we need this comment. Appears that you are just given this sequence a name. Is there a reference?
14:31
T. D. Noe: Reference that uses your new name.
#11 by Edward Jiang at Wed Dec 04 20:15:20 EST 2013
COMMENTS

Define a "super-squared n-tuple" as an n-tuple in which the components are increasing and the sum of the squares of the first k components in the tuple is a perfect square, for all 1<=k<=n. Then this sequence gives the minimal sum of the components of a super-squared n-tuple. - Edward Jiang, Dec 4 2013

STATUS

approved

editing

#10 by Max Alekseyev at Fri Nov 23 19:51:41 EST 2012
STATUS

editing

approved

#9 by Max Alekseyev at Fri Nov 23 19:51:35 EST 2012
CROSSREFS

Apart from the initial term, the sequence is the same as A053631.

STATUS

approved

editing

#8 by Max Alekseyev at Fri Nov 23 12:46:21 EST 2012
STATUS

editing

approved

#7 by Max Alekseyev at Fri Nov 23 12:46:16 EST 2012
LINKS

Sierpinski W., <a href="http://pldml.icm.edu.pl/pldml/details/contents.action?id=bwmeta1.element.dl-catalog-556369c7-b6cc-4a5b-be36-bfc8e0ca7cfa">Elementary theory of numbers</a>, Monografie Matematyczne 42 (1964), Chapter II, p. 63.

STATUS

approved

editing

#6 by Max Alekseyev at Fri Nov 23 12:45:11 EST 2012
STATUS

editing

approved

#5 by Max Alekseyev at Fri Nov 23 12:45:07 EST 2012
NAME

a(1)=3; for n>1, a(n) is least number such that a(1)^2+...+a(n)^2 is a square and is equal to = (1+a(n))^2.

DATA

3, 4, 12, 84, 3612, 6526884, 21300113901612, 226847426110843688722000884, 25729877366557343481074291996721923093306518970391612, 331013294649039928396936390888878360035026305412754995683702777533071737279144813617823976263475290370884

REFERENCES

Sierpinski W., 1959 Toria Liczb (=Theory of Numbers) Part II. Monografie Matematyczne Tom 38. PWN Warszawa, pp. 1-487 (p.76).

LINKS

Sierpinski W., <a href="http://pldml.icm.edu.pl/pldml/details/contents.action?id=bwmeta1.element.dl-catalog-556369c7-b6cc-4a5b-be36-bfc8e0ca7cfa">Elementary theory of numbers</a>, Monografie Matematyczne 42 (1964), p. 63.

FORMULA

Conjecture: For n>2, a(n) =A053630 (a(1)^2 + a(2)^2 + ... + a(n-1)^2 - 1 for )/2 = ((a(n>=-1) + 1)^2 - 1)/2. - _R. J. Mathar_, Apr Max Alekseyev_, Nov 23 20072012

a(n) = A053630(n-1)-1 for n>=2. - R. J. Mathar, Apr 23 2007

STATUS

approved

editing

#4 by Russ Cox at Sat Mar 31 10:22:04 EDT 2012
AUTHOR

_Artur Jasinski (grafix(AT)csl.pl), _, Jan 23 2007, Jan 29 2007

Discussion
Sat Mar 31
10:22
OEIS Server: https://oeis.org/edit/global/339