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.

A068793 a(n) = Sum_{i=1..n} i*(n^(n-i-1) + n^(n+i-1)).

This page as a plain text file.
%I A068793 #11 Mar 19 2024 03:31:20
%S A068793 5,194,14619,1831444,348288905,94197694758,34466324363639,
%T A068793 16416600747716168,9876543210123456789,7326247444821284733610,
%U A068793 6569987372181208872192659,7007407167541356868004228892
%N A068793 a(n) = Sum_{i=1..n} i*(n^(n-i-1) + n^(n+i-1)).
%C A068793 a(n) = A062813(n)*n^(n-1) + A023811(n).
%C A068793 a(n) is a palindrome in base-n representation for all n.
%F A068793 a(n) = (n^n*(n^n*(n-2)+2)-n^2+n-1)/(n-1)^2.
%e A068793 a(2) = 5 = 101_2;
%e A068793 a(8) = 34466324363639 = 765432101234567_8;
%e A068793 a(10) = 9876543210123456789;
%e A068793 a(16) = 21173125052858393282329502187520773615 = FEDC...876543210123456789ABCDEF_16.
%o A068793 (Python)
%o A068793 def A068793(n): return ((m:=n**n)*(m*(n-2)+2)-n**2+n-1)//(n-1)**2 # _Chai Wah Wu_, Mar 18 2024
%Y A068793 Cf. A023811, A062813, A068792.
%K A068793 nonn
%O A068793 2,1
%A A068793 _Reinhard Zumkeller_, Mar 04 2002