|
%I #9 Jul 13 2013 12:04:23
%S 1,1,2,2,3,3,4,3,4,4,4,4,6,6,4,3,4,5,6,5,5,6,7,9,3,3,4,4,5,6,4,2,4,5,
%T 4,5,5,7,7,9,5,5,7,8,8,6,6,10,7,4,4,4,6,7,6,4,5,7,7,10,6,7,6,5,6,6,6,
%U 8,7,8,7,8,7,9,5,4,5,6,7,6,5,5,6,7,7,6
%N Number of distinct values in n-th row of Pascal's triangle mod 10 (A008975).
%H Reinhard Zumkeller, <a href="/A208280/b208280.txt">Table of n, a(n) for n = 0..10000</a>
%e Smallest numbers m such that a(m) = n, m = 1,..,9:
%e m | distinct terms in A008975(m,*) | a(m)
%e -----+----------------------------------+-------
%e 0 | [1] | 1
%e 2 | [1, 2] | 2
%e 4 | [1, 4, 6] | 3
%e 6 | [0, 1, 5, 6] | 4
%e 17 | [0, 1, 6, 7, 8] | 5
%e 12 | [0, 1, 2, 4, 5, 6] | 6
%e 22 | [0, 1, 2, 3, 4, 5, 6] | 7
%e 43 | [0, 1, 3, 4, 5, 6, 8, 9] | 8
%e 23 | [0, 1, 3, 4, 5, 6, 7, 8, 9] | 9
%e 47 | [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] | 10
%o (Haskell)
%o import Data.List (nub)
%o a208280 = length . nub . a008975_row
%K nonn
%O 0,3
%A _Reinhard Zumkeller_, Feb 25 2012
|
