|
| |
|
|
A101467
|
|
Number of distinct values taken by x_1:x_2:...:x_n where each x_i is in the range [1-10].
|
|
0
| |
|
|
10, 63, 841, 9279, 96601, 983583, 9919561, 99602559, 998026681, 9990174303, 99950992681, 999755323839, 9998777694361, 99993891685023, 999969468040201, 9999847368997119, 99999236931275641, 999996184915051743
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
FORMULA
| a(1) = 10; for n>1, a(n) = 10^n - 5^n - 3^n - 2^n + 1
|
|
|
EXAMPLE
| For n=2: Consider 1:1, 1:2, ..., 1:10, 2:1, 2:2, ..., 2:10, ..., 10:1, 10:2, ..., 10:10. We get 63 different numbers from the 100 numbers list above after removing duplication. So a(2) = 63.
|
|
|
CROSSREFS
| Sequence in context: A093953 A075755 A046638 * A162473 A138661 A178256
Adjacent sequences: A101464 A101465 A101466 * A101468 A101469 A101470
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Su Jianning (sujianning(AT)yahoo.com.cn), Jan 21 2005
|
| |
|
|
