|
|
A101403
|
|
Number of times that n occurs in A101402.
|
|
6
|
|
|
1, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 3, 3, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 2, 3, 2, 4, 3, 2, 3, 3, 2, 4, 4, 3, 2, 4, 3, 2, 3, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,2
|
|
COMMENTS
|
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
A101403 = Table[Count[TheList, i], {i, 0, Last[TheList]}]
(* Keith Schneider, May 25 2007 *)
|
|
PROG
|
(Haskell)
import Data.List (group)
a101403 n = a101403_list !! n
a101403_list = map length $ group a101402_list
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
More terms from Keith Schneider, May 25 2007
|
|
STATUS
|
approved
|
|
|
|