|
Search: id:A112104
|
|
|
| A112104 |
|
Unique sequence of 1's and 2's where g.f. A(x) satisfies A(x) = B(B(x)) such that B(x) is an integer series, with A(0) = 0. |
|
+0
24
|
|
| 1, 2, 2, 1, 2, 1, 2, 2, 1, 2, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 2, 2, 2, 1, 1, 1, 2, 2, 2, 2, 2, 1, 1, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 2, 2, 1
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Paul D. Hanna, Table of n, a(n) for n = 1..512
|
|
EXAMPLE
|
G.f.: A(x) = x + 2*x^2 + 2*x^3 + x^4 + 2*x^5 + x^6 +...
then A(x) = B(B(x)) where
B(x) = x + x^2 + x^5 - 3*x^6 + 7*x^7 - 10*x^8 - 5*x^9 +...
is the g.f. of A112105.
|
|
PROGRAM
|
(PARI) {a(n, m=2)=local(F=x+x^2+x*O(x^n), G); if(n<1, 0, for(k=3, n, G=F+x*O(x^k); for(i=1, m-1, G=subst(F, x, G)); F=F-((polcoeff(G, k)-1)\m)*x^k); G=F+x*O(x^n); for(i=1, m-1, G=subst(F, x, G)); return(polcoeff(G, n, x)))}
|
|
CROSSREFS
|
Cf. A112105, A112106-A112127.
Sequence in context: A052005 A138702 A144462 this_sequence A059426 A082389 A119469
Adjacent sequences: A112101 A112102 A112103 this_sequence A112105 A112106 A112107
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Paul D. Hanna (pauldhanna(AT)juno.com), Aug 27 2005
|
|
|
Search completed in 0.002 seconds
|
