|
Search: id:A055276
|
|
| |
|
| 1, 10, 110, 1210, 13310, 146410, 1610510, 17715610, 194871710, 2143588810, 23579476910, 259374246010, 2853116706110, 31384283767210, 345227121439310, 3797498335832410, 41772481694156510, 459497298635721610
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
REFERENCES
|
A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.
|
|
LINKS
|
Milan Janjic, Enumerative Formulas for Some Functions on Finite Sets
|
|
FORMULA
|
a(n)=11a(n-1)+[(-1)^n]*C(1, 1-n).
|
|
EXAMPLE
|
a(n)=10*11^(n-1); a(0)=1. G.f.(x)=(1-x)/(1-11x).
|
|
MATHEMATICA
|
Table[EulerPhi[11^n], {n, 0, 40}] [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 10 2009]
|
|
CROSSREFS
|
Cf. A001020.
Sequence in context: A102092 A105279 A057093 this_sequence A143749 A049398 A055530
Adjacent sequences: A055273 A055274 A055275 this_sequence A055277 A055278 A055279
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Barry E. Williams, May 29 2000
|
|
EXTENSIONS
|
More terms from James A. Sellers (sellersj(AT)math.psu.edu), May 31 2000
|
|
|
Search completed in 0.002 seconds
|
