A290092 -id:A290092 - cp's OEIS frontend

A290093 Compound filter (for base-3 digit runlengths): a(n) = P(A290091(n), A290092(n)), where P(n,k) is sequence A000027 used as a pairing function.

1, 3, 2, 3, 10, 5, 2, 5, 7, 3, 21, 5, 10, 36, 14, 5, 27, 12, 2, 5, 16, 5, 14, 23, 7, 12, 29, 3, 21, 5, 21, 78, 27, 5, 27, 12, 10, 78, 14, 36, 136, 44, 14, 90, 25, 5, 27, 23, 27, 90, 61, 12, 42, 38, 2, 5, 16, 5, 14, 23, 16, 23, 67, 5, 27, 23, 14, 44, 40, 23, 61, 80, 7, 12, 67, 12, 25, 80, 29, 38, 121, 3, 21, 5, 21, 78, 27, 5, 27, 12, 21, 465, 27, 78, 300, 90, 27

Offset: 0

Antti Karttunen, Jul 25 2017

nonn

For all i, j: a(i) = a(j) => A006047(i) = A006047(j) => A053735(i) = A053735(j).

Antti Karttunen, Table of n, a(n) for n = 0..19683

Cf. A000027, A278222, A289813, A289814, A290091, A290092.

Cf. A006047, A053735, A290079 (some of the matched sequences).

(define (A290093 n) (* (/ 1 2) (+ (expt (+ (A290091 n) (A290092 n)) 2) (- (A290091 n)) (- (* 3 (A290092 n))) 2)))

a(n) = (1/2)*(2 + ((A290091(n)+A290092(n))^2) - A290091(n) - 3*A290092(n)).

A293224 Restricted growth sequence transform of A293222, a product formed from the 2-digits present in the ternary expansions of proper divisors of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 2, 1, 2, 1, 3, 1, 4, 1, 4, 2, 5, 1, 4, 1, 3, 6, 3, 1, 7, 2, 2, 1, 5, 1, 7, 1, 7, 2, 5, 4, 8, 1, 9, 1, 10, 1, 11, 1, 12, 4, 12, 1, 13, 6, 14, 4, 14, 1, 8, 3, 15, 16, 3, 1, 17, 1, 2, 18, 15, 2, 11, 1, 7, 9, 19, 1, 20, 1, 2, 21, 12, 4, 11, 1, 22, 1, 3, 1, 23, 5, 4, 2, 22, 1, 24, 6, 25, 1, 12, 9, 26, 1, 14, 4, 27, 1, 13, 1, 28, 23, 14, 1, 29, 1, 30

Offset: 1

Antti Karttunen, Oct 03 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 1..19683

Cf. A293222.

Cf. also A290092, A293223, A293215, A293217, A293232, A293225, A293226.

rgs_transform(invec) = { my(om = Map(), outvec = vector(length(invec)), u=1); for(i=1, length(invec), if(mapisdefined(om,invec[i]), my(pp = mapget(om, invec[i])); outvec[i] = outvec[pp] , mapput(om,invec[i],i); outvec[i] = u; u++ )); outvec; };
write_to_bfile(start_offset,vec,bfilename) = { for(n=1, length(vec), write(bfilename, (n+start_offset)-1, " ", vec[n])); }
A019565(n) = {my(j,v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ This function from M. F. Hasler
A289814(n) = { my (d=digits(n, 3)); fromdigits(vector(#d, i, if (d[i]==2, 1, 0)), 2); } \\ From Remy Sigrist
A293222(n) = { my(m=1); fordiv(n,d,if(d < n,m *= A019565(A289814(d)))); m; };
write_to_bfile(1,rgs_transform(vector(19683,n,A293222(n))),"b293224.txt");

A290094 Restricted growth sequence transform of A290093.

Original entry on oeis.org

1, 2, 3, 2, 4, 5, 3, 5, 6, 2, 7, 5, 4, 8, 9, 5, 10, 11, 3, 5, 12, 5, 9, 13, 6, 11, 14, 2, 7, 5, 7, 15, 10, 5, 10, 11, 4, 15, 9, 8, 16, 17, 9, 18, 19, 5, 10, 13, 10, 18, 20, 11, 21, 22, 3, 5, 12, 5, 9, 13, 12, 13, 23, 5, 10, 13, 9, 17, 24, 13, 20, 25, 6, 11, 23, 11, 19, 25, 14, 22, 26, 2, 7, 5, 7, 15, 10, 5, 10, 11, 7, 27, 10, 15, 28, 18, 10, 29, 21, 5, 10, 13

Offset: 0

Antti Karttunen, Jul 26 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 0..59049

For all i, j: a(i) = a(j) <=> A290093(n) = A290093(n), thus this matches to all the same base-3 (ternary) related sequences as A290093: A006047, A053735, A062756, A081603, A117942, A206424, A227428, A290091, A290092, A290079, and many others.

A290091 Filter based on 1-digits of base-3 expansion: a(n) = A278222(A289813(n)).

Original entry on oeis.org

1, 2, 1, 2, 4, 2, 1, 2, 1, 2, 6, 2, 4, 8, 4, 2, 6, 2, 1, 2, 1, 2, 4, 2, 1, 2, 1, 2, 6, 2, 6, 12, 6, 2, 6, 2, 4, 12, 4, 8, 16, 8, 4, 12, 4, 2, 6, 2, 6, 12, 6, 2, 6, 2, 1, 2, 1, 2, 4, 2, 1, 2, 1, 2, 6, 2, 4, 8, 4, 2, 6, 2, 1, 2, 1, 2, 4, 2, 1, 2, 1, 2, 6, 2, 6, 12, 6, 2, 6, 2, 6, 30, 6, 12, 24, 12, 6, 30, 6, 2, 6, 2, 6, 12, 6, 2

Offset: 0

Antti Karttunen, Jul 25 2017

nonn

Antti Karttunen, Table of n, a(n) for n = 0..19683

Cf. A278222, A289813, A290092, A290093.

(define (A290091 n) (A278222 (A289813 n)))

A291771 Filter based on runlengths of 0-digits in base-3 expansion of n: a(n) = A278222(A291770(n)).

Original entry on oeis.org

1, 1, 2, 1, 1, 2, 1, 1, 4, 2, 2, 2, 1, 1, 2, 1, 1, 4, 2, 2, 2, 1, 1, 2, 1, 1, 8, 4, 4, 6, 2, 2, 6, 2, 2, 4, 2, 2, 2, 1, 1, 2, 1, 1, 4, 2, 2, 2, 1, 1, 2, 1, 1, 8, 4, 4, 6, 2, 2, 6, 2, 2, 4, 2, 2, 2, 1, 1, 2, 1, 1, 4, 2, 2, 2, 1, 1, 2, 1, 1, 16, 8, 8, 12, 4, 4, 12, 4, 4, 12, 6, 6, 6, 2, 2, 6, 2, 2, 12, 6, 6, 6, 2, 2, 6

Offset: 1

Antti Karttunen, Sep 11 2017

Antti Karttunen, Table of n, a(n) for n = 1..59049

Cf. A007089, A077267, A278222, A291770, A290091, A290092, A290093, A290094.

f[n_, i_, x_] := Which[n == 0, x, EvenQ@ n, f[n/2, i + 1, x], True, f[(n - 1)/2, i, x Prime@ i]]; Array[If[# == 1, 1, Times @@ MapIndexed[Prime[First[#2]]^#1 &, Sort[FactorInteger[#][[All, -1]], Greater]]] &@ f[FromDigits[IntegerDigits[#, 3] /. k_ /; k < 3 :> If[k == 0, 1, 0], 2], 1, 1] &, 96] (* Michael De Vlieger, Sep 11 2017 *)

a(n) = A278222(A291770(n)).

cp's OEIS Frontend

A290093 Compound filter (for base-3 digit runlengths): a(n) = P(A290091(n), A290092(n)), where P(n,k) is sequence A000027 used as a pairing function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Scheme

Formula

A293224 Restricted growth sequence transform of A293222, a product formed from the 2-digits present in the ternary expansions of proper divisors of n.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

A290094 Restricted growth sequence transform of A290093.

Views

Author

Keywords

Links

Crossrefs

A290091 Filter based on 1-digits of base-3 expansion: a(n) = A278222(A289813(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Scheme

A291771 Filter based on runlengths of 0-digits in base-3 expansion of n: a(n) = A278222(A291770(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Formula