login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A033111 Number of 9's when n is written in base b for 2<=b<=n+1. 10

%I

%S 0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,1,1,1,1,2,1,2,1,2,1,

%T 2,1,2,1,3,1,2,2,2,1,3,1,2,2,3,1,3,1,3,2,2,1,4,1,3,2,3,1,3,2,3,2,2,1,

%U 6,1,2,2,3,2,4,1,3,2,4,1,5,1,2,3,3,2,4,1,5,3

%N Number of 9's when n is written in base b for 2<=b<=n+1.

%t f[n_] := Count[Flatten@ Table[ IntegerDigits[n, b], {b, 2, n + 1}], 9]; Array[f, 90](* _Robert G. Wilson v_, Nov 14 2012 *)

%Y Cf. A033093, A033095, A033097, A033099, A033101, A033103, A033105, A033107, A033109, A033112.

%K nonn,base

%O 1,29

%A _Clark Kimberling_

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified May 20 02:57 EDT 2013. Contains 225446 sequences.