[go: up one dir, main page]

login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Search: a110632 -id:a110632
     Sort: relevance | references | number | modified | created      Format: long | short | data
Every third term of A083946 where the self-convolution third power is congruent modulo 9 to A083946, which consists entirely of numbers 1 through 6.
+10
3
1, 2, 6, 4, 6, 4, 3, 2, 6, 4, 2, 6, 6, 4, 4, 2, 4, 2, 6, 4, 3, 4, 2, 6, 1, 4, 2, 2, 3, 4, 1, 6, 6, 2, 6, 6, 1, 6, 2, 6, 6, 2, 4, 6, 2, 4, 4, 4, 2, 6, 6, 2, 2, 6, 4, 4, 2, 6, 6, 4, 5, 4, 2, 6, 2, 4, 1, 2, 5, 2, 3, 4, 6, 6, 6, 6, 2, 4, 5, 2, 3, 2, 1, 2, 4, 2, 5, 2, 4, 2, 6, 2, 2, 4, 4, 4, 3, 2, 1, 2, 6, 6, 2, 6, 3
OFFSET
0,2
EXAMPLE
A(x) = 1 + 2*x + 6*x^2 + 4*x^3 + 6*x^4 + 4*x^5 + 3*x^6 + ...
A(x)^3 = 1 + 6*x + 30*x^2 + 92*x^3 + 246*x^4 + 492*x^5 + ...
A(x)^3 (mod 9) = 1 + 6*x + 3*x^2 + 2*x^3 + 3*x^4 + 6*x^5 + ...
G(x) = 1 + 6*x + 3*x^2 + 2*x^3 + 3*x^4 + 6*x^5 + ...
where G(x) is the g.f. of A083946.
PROG
(PARI) {a(n)=local(d=3, m=6, A=1+m*x); for(j=2, d*n, for(k=1, m, t=polcoeff((A+k*x^j+x*O(x^j))^(1/m), j); if(denominator(t)==1, A=A+k*x^j; break))); polcoeff(A, d*n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
Every 2nd term of A083946 where the self-convolution 2nd power is congruent modulo 4 to A083946, which consists entirely of numbers 1 through 6.
+10
2
1, 3, 3, 6, 3, 6, 6, 3, 6, 3, 6, 3, 6, 3, 6, 2, 6, 6, 6, 3, 6, 4, 6, 6, 4, 3, 3, 6, 3, 3, 3, 3, 6, 2, 3, 3, 1, 6, 6, 2, 6, 6, 3, 3, 6, 1, 6, 6, 6, 3, 6, 6, 3, 6, 1, 6, 6, 2, 3, 6, 6, 3, 3, 4, 6, 6, 2, 3, 6, 4, 3, 6, 2, 6, 3, 6, 3, 6, 2, 6, 6, 4, 3, 3, 2, 3, 3, 6, 3, 3, 5, 3, 3, 2, 6, 6, 2, 3, 6, 1, 3, 3, 5, 3, 6
OFFSET
0,2
EXAMPLE
A(x) = 1 + 3*x + 3*x^2 + 6*x^3 + 3*x^4 + 6*x^5 + 6*x^6 +...
A(x)^2 = 1 + 6*x + 15*x^2 + 30*x^3 + 51*x^4 + 66*x^5 +...
A(x)^2 (mod 4) = 1 + 2*x + 3*x^2 + 2*x^3 + 3*x^4 + 2*x^5 +...
G(x) = 1 + 6*x + 3*x^2 + 2*x^3 + 3*x^4 + 6*x^5 +...
where G(x) is the g.f. of A083946.
PROG
(PARI) {a(n)=local(d=2, m=6, A=1+m*x); for(j=2, d*n, for(k=1, m, t=polcoeff((A+k*x^j+x*O(x^j))^(1/m), j); if(denominator(t)==1, A=A+k*x^j; break))); polcoeff(A, d*n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved
Every 8th term of A083948 where the self-convolution 8th power is congruent modulo 16 to A083948, which consists entirely of numbers 1 through 8.
+10
2
1, 7, 3, 1, 6, 6, 4, 8, 7, 8, 8, 7, 3, 3, 3, 1, 4, 3, 6, 5, 1, 6, 6, 1, 1, 5, 4, 8, 5, 5, 4, 6, 5, 8, 7, 6, 5, 6, 6, 5, 8, 4, 7, 4, 1, 3, 7, 7, 4, 6, 8, 7, 4, 8, 8, 1, 5, 3, 5, 5, 6, 2, 4, 4, 7, 2, 6, 2, 1, 4, 3, 5, 5, 3, 5, 1, 5, 3, 7, 8, 6, 5, 1, 2, 1, 1, 2, 4, 6, 1, 6, 3, 5, 1, 7, 3, 4, 2, 6, 7, 1, 3, 1, 8, 3
OFFSET
0,2
EXAMPLE
A(x) = 1 + 7*x + 3*x^2 + x^3 + 6*x^4 + 6*x^5 + 4*x^6 + 8*x^7 +...
A(x)^8 = 1 + 56*x + 1396*x^2 + 20392*x^3 + 193458*x^4 +...
A(x)^8 (mod 16) = 1 + 8*x + 4*x^2 + 8*x^3 + 2*x^4 + 8*x^5 +...
G(x) = 1 + 8*x + 4*x^2 + 8*x^3 + 2*x^4 + 8*x^5 + 4*x^6 +...
where G(x) is the g.f. of A083948.
PROG
(PARI) {a(n)=local(d=8, m=8, A=1+m*x); for(j=2, d*n, for(k=1, m, t=polcoeff((A+k*x^j+x*O(x^j))^(1/m), j); if(denominator(t)==1, A=A+k*x^j; break))); polcoeff(A, d*n)}
CROSSREFS
KEYWORD
nonn
AUTHOR
STATUS
approved

Search completed in 0.005 seconds