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.

A138748 a(n) = (n+(n+1)) + (n*(n+1)) + (n^(n+1)).

This page as a plain text file.
%I A138748 #8 Sep 13 2024 17:49:20
%S A138748 1,6,19,100,1053,15666,279991,5764872,134217817,3486784510,
%T A138748 100000000131,3138428376876,106993205379253,3937376385699498,
%U A138748 155568095557812463,6568408355712890896,295147905179352826161,14063084452067724991350,708235345355337676358011,37589973457545958193356020,2097152000000000000000000461
%N A138748 a(n) = (n+(n+1)) + (n*(n+1)) + (n^(n+1)).
%C A138748 Sum of three arithmetic operations (sum, product, powers) of two consecutive integers.
%F A138748 a(n) = A028387(n) + A007778(n). - _R. J. Mathar_, Apr 03 2008
%e A138748 a(0) = (0+1) + (0*1) + (0^1) = 1;
%e A138748 a(1) = (1+2) + (1*2) + (1^2) = 6;
%e A138748 a(2) = (2+3) + (2*3) + (2^3) = 19; etc.
%p A138748 A028387 := proc(n) n+(n+1)^2 ; end: A007778 := proc(n) n^(n+1) ; end: A138748 := proc(n) A028387(n)+A007778(n) ; end: seq(A138748(n),n=0..20) ; # _R. J. Mathar_, Apr 03 2008
%t A138748 Table[2n+1+n(n+1)+n^(n+1),{n,0,20}] (* _Harvey P. Dale_, Sep 13 2024 *)
%K A138748 easy,nonn
%O A138748 0,2
%A A138748 _Anthony J. DeFusco II_, Mar 28 2008
%E A138748 More terms from _R. J. Mathar_, Apr 03 2008