cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A060375 a(n) = (n+2)^(n+3) - n^(n+1).

This page as a plain text file.
%I A060375 #18 Oct 07 2023 19:09:13
%S A060375 8,80,1016,15544,278912,5749176,133937792,3481019600,99865782272,
%T A060375 3134941592320,106893205379072,3934237957322568,155461102352433152,
%U A060375 6564470979327191336,294992337083795013632,14056516043712012100384
%N A060375 a(n) = (n+2)^(n+3) - n^(n+1).
%C A060375 a(n) is divisible by 8. 2^(3+4k) divides a(4k) and a(4k+2). 8k divides a(4k-1). 4(4k+2) divides a(4k+1). - _Alexander Adamchuk_, Nov 18 2006
%H A060375 Harry J. Smith, <a href="/A060375/b060375.txt">Table of n, a(n) for n = 0..100</a>
%F A060375 a(n) = A007778(n+2) - A007778(n). - _Alexander Adamchuk_, Nov 18 2006
%e A060375 a(1) = |0^1 - 2^3| = 8, a(2) = |1^2 - 3^4| = 80.
%t A060375 Table[(-n^(n+1)+(n+2)^(n+3)),{n,0,18}] (* _Alexander Adamchuk_, Nov 18 2006 *)
%t A060375 #[[3]]^#[[4]]-#[[1]]^#[[2]]&/@Partition[Range[0,20],4,1] (* _Harvey P. Dale_, Oct 07 2023 *)
%o A060375 (PARI) { for (n=0, 100, write("b060375.txt", n, " ", (n + 2)^(n + 3) - n^(n + 1)); ) } \\ _Harry J. Smith_, Jul 04 2009
%Y A060375 Cf. A007778 (n^(n+1)).
%K A060375 nonn
%O A060375 0,1
%A A060375 _Jason Earls_, Apr 02 2001
%E A060375 More terms from Larry Reeves (larryr(AT)acm.org), Apr 20 2001
%E A060375 Better description from _Alexander Adamchuk_, Nov 18 2006