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.

A230866 Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n.

This page as a plain text file.
%I A230866 #8 Nov 05 2013 18:16:26
%S A230866 1,1,1,2,2,1,2,2,1,2,2,1,2,3,2,2,3,2,1,2,2,1,2,2,1,2,3,2,2,3,2,1,2,2,
%T A230866 1,2,2,1,2,3,2,2,3,2,1,2,2,1,2,2,1,2,3,2,2,3,2,1,2,2,1,2,2,2,3,3,3,3,
%U A230866 2,2,2,1,2,2,1,2,3,2,2,3,2,1,2,2,1,2,2,1,2,3,2,2,3,2,1,2,2,1,2,2,1,2,3
%N A230866 Number of integers m such that m + (sum of digits in base-5 representation of m) = 2n.
%H A230866 Donovan Johnson, <a href="/A230866/b230866.txt">Table of n, a(n) for n = 0..10000</a>
%Y A230866 Cf. A230865, A230643.
%K A230866 nonn,base
%O A230866 0,4
%A A230866 _N. J. A. Sloane_, Nov 05 2013