Yes, this thing is true. Rephrasing it more explicitly:
We're looking at f(n) := n^2 + (n+1)^2 = 2n^2 + 2n + 1 = 2n(n+1) + 1. If n is -2, -1, 0, 1, 2 mod 5 then f(n) is 0, 1, 1, 0, 3 mod 5.
Suppose n = 5m+2; then f(n) = 2(5m+2)(5m+3) + 1 = 50m(m+1) + 13 = 100 m(m+1)/2 + 13.
So for these values of n the values are obtained by 100 . triangular + 13.
I don't think this really has anything to do with Fermat's "Christmas theorem". Yes, you're taking a sum of two squares, but "sums of two squares" and "sums of two _consecutive_ squares" are very different things.
--
g
--
You received this message because you are subscribed to the Google Groups "SeqFan" group.
To unsubscribe from this group and stop receiving emails from it, send an email to seqfan+un...@googlegroups.com.
To view this discussion visit https://groups.google.com/d/msgid/seqfan/CACGMPepTZJBHjWVpkHobj8Gv5Qbw-UTzyBZAOU%2BnNpG%3D8f6XpA%40mail.gmail.com.
>> So for these values of n the values are obtained by 100 . triangular + 13.
Yes, I added a similar remark for that on second column paragraph (and s(k) = 100.T(k) + 40.k + 41)
Interestingly, while there is a relationship between some sums of 2 consecutive squares and triangular numbers...There is also a relationship between 2 consecutive triangular numbers and the squares.And if you combine these 2 findings, you end up with: (5k-3)^2 + (5k-2)^2 + (5k+2)^2 + (5k+3)^2 = 100k^2 + 26 for any k.There is also a relationship between the sums of 2 even triangular numbers and some squares (specifically 16n^2), see A016802.Daniel.