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.

A190311 Number of nonzero digits when writing n in base where place values are positive cubes, cf. A000433.

This page as a plain text file.
%I A190311 #9 Jul 13 2013 12:04:08
%S A190311 0,1,1,1,1,1,1,1,1,2,2,2,2,2,2,2,1,2,2,2,2,2,2,2,1,2,2,1,2,2,2,2,2,2,
%T A190311 2,2,3,3,3,3,3,3,3,2,3,3,3,3,3,3,3,2,3,3,1,2,2,2,2,2,2,2,2,3,1,2,2,2,
%U A190311 2,2,2,2,2,3,3,3,3,3,3,3,2,3,3,3,3,3
%N A190311 Number of nonzero digits when writing n in base where place values are positive cubes, cf. A000433.
%C A190311 For n > 0: a(A000578(n)) = 1; for n > 1: a(A001093(n)) = 2;
%C A190311 a(n) <= A048766(n).
%H A190311 Reinhard Zumkeller, <a href="/A190311/b190311.txt">Table of n, a(n) for n = 0..10000</a>
%o A190311 (Haskell)
%o A190311 a190311 n = g n $ reverse $ takeWhile (<= n) $ tail a000578_list where
%o A190311   g _ []                 = 0
%o A190311   g m (x:xs) | x > m     = g m xs
%o A190311              | otherwise = signum m' + g r xs where (m',r) = divMod m x
%Y A190311 Cf. A190321, A055640.
%K A190311 nonn,base
%O A190311 0,10
%A A190311 _Reinhard Zumkeller_, May 08 2011