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.

A014843 Sum modulo n of the sum modulo n of all the digits of n in every base from 2 to n-1.

This page as a plain text file.
%I A014843 #8 Aug 22 2012 23:04:04
%S A014843 2,2,2,3,1,7,2,4,1,9,6,9,14,8,5,0,14,11,19,3,20,7,18,25,5,2,24,12,5,
%T A014843 27,9,18,0,8,0,10,26,12,3,30,21,19,24,37,27,39,17,14,36,35,24,3,32,17,
%U A014843 42,1,47,56,44,0,11,49,21,2,55,55,17,5,61,69,55,3,14,14,59,38,22,62
%N A014843 Sum modulo n of the sum modulo n of all the digits of n in every base from 2 to n-1.
%C A014843 This is a variant of A014836 and A014837. Cf. A116987.
%K A014843 nonn,base
%O A014843 3,1
%A A014843 _Olivier Gérard_