[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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

Showing entries 1-10 | older changes
Maximum remainder when (k + 1)^n + (k - 1)^n is divided by k^2 for variable n and k > 2.
(history; published version)
#52 by Alois P. Heinz at Fri Feb 21 20:07:41 EST 2020
STATUS

editing

approved

#51 by Alois P. Heinz at Fri Feb 21 20:07:39 EST 2020
LINKS

Project Euler, <a href="http://projecteuler.net/index.php?section=problems&amp;id=120">Problem 120: Square remainders</a>

STATUS

approved

editing

#50 by Harvey P. Dale at Wed Apr 18 09:32:50 EDT 2018
STATUS

editing

approved

#49 by Harvey P. Dale at Wed Apr 18 09:32:46 EDT 2018
MATHEMATICA

LinearRecurrence[{1, 2, -2, -1, 1}, {6, 8, 20, 24, 42}, 50] (* Harvey P. Dale, Apr 18 2018 *)

STATUS

approved

editing

#48 by Charles R Greathouse IV at Fri Dec 08 12:59:37 EST 2017
STATUS

editing

approved

#47 by Charles R Greathouse IV at Fri Dec 08 12:58:44 EST 2017
KEYWORD

nonn,easy,changed

STATUS

proposed

editing

Discussion
Fri Dec 08
12:59
Charles R Greathouse IV: Thank you! Any sequence with a linear recurrence like this automatically gets keyword:easy as well.
#46 by Iain Fox at Fri Dec 08 02:49:21 EST 2017
STATUS

editing

proposed

#45 by Iain Fox at Fri Dec 08 02:49:09 EST 2017
LINKS

<a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,2,-2,-1,1).

STATUS

approved

editing

#44 by Bruno Berselli at Thu Nov 30 04:45:25 EST 2017
STATUS

reviewed

approved

#43 by Joerg Arndt at Thu Nov 30 04:15:22 EST 2017
STATUS

proposed

reviewed