This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A352705 #7 Sep 01 2022 12:01:18
%S A352705 1,1,-3,13,-65,351,-1989,11650,-69900,427167,-2648438,16612947,
%T A352705 -105215448,671760933,-4318468134,27926126553,-181520036178,
%U A352705 1185220461867,-7769787812787,51117085998498,-337373170647840,2233091755252871,-14819626692452231,98582852467595847
%N A352705 G.f. A(x) satisfies: A(x)^7 = A(x^7) + 7*x.
%C A352705 Not the same as A106227.
%e A352705 G.f.: A(x) = 1 + x - 3*x^2 + 13*x^3 - 65*x^4 + 351*x^5 - 1989*x^6 + 11650*x^7 - 69900*x^8 + 427167*x^9 - 2648438*x^10 + ...
%e A352705 such that A(x)^7 = A(x^7) + 7*x, as illustrated by:
%e A352705 A(x)^7 = 1 + 7*x + x^7 - 3*x^14 + 13*x^21 - 65*x^28 + 351*x^35 - 1989*x^42 + 11650*x^49 - 69900*x^56 + 427167*x^63 - 2648438*x^70 + ...
%o A352705 (PARI) {a(n) = my(A=1+x); for(i=1,n,
%o A352705 A = (subst(A,x,x^7) + 7*x + x*O(x^n))^(1/7));
%o A352705 polcoeff(A,n)}
%o A352705 for(n=0,30,print1(a(n),", "))
%Y A352705 Cf. A107092, A352706, A352703.
%K A352705 sign
%O A352705 0,3
%A A352705 _Paul D. Hanna_, Mar 29 2022