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.

A045814 Number of times the digits are repeated in A045813.

This page as a plain text file.
%I A045814 #20 Nov 12 2022 09:12:39
%S A045814 4,3,6,3,3,3,3,6,12,7,2,2,2,2,2,2,2,2,2,2,2,2,2,2,4,2,2,4,2,4,4,2,2,6,
%T A045814 2,2,2,2,4,6,4,2,2,6,8,2,4,4,6,2,2,4,6,2,4,16,2,2,4,4,4,2,8,2,2,4,2,
%U A045814 12,2,2,12,10,2,4,2,4,12,2,6,12,10,4,4,4,4,2,4,4,4,4,8,4,8,4,4,2,2,2,6,4
%N A045814 Number of times the digits are repeated in A045813.
%H A045814 Naohiro Nomoto, <a href="https://web.archive.org/web/20000916012426/http://www.geocities.co.jp/Technopolis/1793/09digit.htm">In the list of divisors of n,... </a>
%e A045814 Divisors of 320 are {1, 2, 10, 13, 20, 32, 130, 320} in base 4; each digit appears 4 times, so a(1) = 4.
%e A045814 Divisors of 20132 are {1, 2, 10033, 20132} in base 4; each digit appears 3 times, so a(2) = 3.
%e A045814 Divisors of 21320 are {1, 2, 10, 20, 1033, 2132, 10330, 21320} in base 4; each digit appears 6 times, so a(3) = 6
%Y A045814 Cf. A038564, A038565.
%K A045814 easy,nonn,base
%O A045814 1,1
%A A045814 _Naohiro Nomoto_