A317930 -id:A317930 - cp's OEIS frontend

A317932 Denominators of certain "Dirichlet Square Root" sequences: a(n) = A046644(n)/(2^A007949(n)).

1, 2, 1, 8, 2, 2, 2, 16, 2, 4, 2, 8, 2, 4, 2, 128, 2, 4, 2, 16, 2, 4, 2, 16, 8, 4, 2, 16, 2, 4, 2, 256, 2, 4, 4, 16, 2, 4, 2, 32, 2, 4, 2, 16, 4, 4, 2, 128, 8, 16, 2, 16, 2, 4, 4, 32, 2, 4, 2, 16, 2, 4, 4, 1024, 4, 4, 2, 16, 2, 8, 2, 32, 2, 4, 8, 16, 4, 4, 2, 256, 8, 4, 2, 16, 4, 4, 2, 32, 2, 8, 4, 16, 2, 4, 4, 256, 2, 16, 4, 64, 2, 4, 2, 32, 4

Offset: 1

Antti Karttunen, Aug 11 2018

These are denominators for rational valued sequences that are obtained as "Dirichlet Square Roots" of sequences b that satisfy the condition b(3) = 2, and b(p) = odd number for any other primes p. For example, A064989, A065769 and A234840. - Antti Karttunen, Aug 31 2018

The original definition was: Denominators of the rational valued sequence whose Dirichlet convolution with itself yields A002487, Stern's Diatomic sequence. However, this definition depends on the conjecture given in A261179.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences related to Stern's sequences

Cf. A317930, A318319, A318669 (some of the numerator sequences), A317931 (conjectured, for A002487).
Cf. A305439 (the 2-adic valuation), A318666.
Cf. also A046644, A261179, A299150, A237649, A299150, A317928, A317839, A317843, A317934, A318319.

\\ Original program, based on conjectural formula:
A002487(n) = { my(a=1, b=0); while(n>0, if(bitand(n, 1), b+=a, a+=b); n>>=1); (b); }; \\ From A002487
A317931perA317932(n) = if(1==n,n,(A002487(n)-sumdiv(n,d,if((d>1)&&(dA317931perA317932(d)*A317931perA317932(n/d),0)))/2);
A317932(n) = denominator(A317931perA317932(n));

\\ New fast program implementing the new definition:
A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
A046644(n) = factorback(apply(e -> 2^A005187(e),factor(n)[,2]));
A317932(n) = (A046644(n)/2^valuation(n,3)); \\ Antti Karttunen, Aug 31 2018

A011371(n) = (A005187(n)-n);
A317932(n) = { my(f = factor(n), m=1); for(i=1, #f~, if(3 == f[i,1], m *= 2^(A011371(f[i,2])), m *= 2^A005187(f[i,2]))); (m); }; \\ Antti Karttunen, Sep 03 2018

a(n) = A046644(n)/A318666(n) = 2^A305439(n).
a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (b(n) - Sum_{d|n, d>1, d 1, where b can be A064989, A065769 or A234840 for example, conjecturally also A002487.
Multiplicative with a(3^e) = 2^A011371(e), a(p^e) = 2^A005187(e) for any other primes. - Antti Karttunen, Sep 03 2018

Definition changed, the original (now conjectured alternative definition) moved to the comments section by Antti Karttunen, Aug 31 2018

Keyword:mult added by Antti Karttunen, Sep 03 2018

A234840 Self-inverse and multiplicative permutation of integers: a(0) = 0, a(1) = 1, a(2) = 3, a(3) = 2, a(p_i) = p_{a(i+1)-1} for primes with index i > 2, and a(u * v) = a(u) * a(v) for u, v > 0.

Original entry on oeis.org

0, 1, 3, 2, 9, 19, 6, 61, 27, 4, 57, 11, 18, 281, 183, 38, 81, 101, 12, 5, 171, 122, 33, 263, 54, 361, 843, 8, 549, 29, 114, 59, 243, 22, 303, 1159, 36, 1811, 15, 562, 513, 1091, 366, 157, 99, 76, 789, 409, 162, 3721, 1083, 202, 2529, 541, 24, 209, 1647, 10, 87, 31

Offset: 0

Antti Karttunen, Dec 31 2013

The permutation satisfies A008578(a(n)) = a(A008578(n)) for all n, and is self-inverse.
The sequence of fixed points begins as 0, 1, 6, 11, 29, 36, 66, 95, 107, 121, 149, 174, 216, 313, 319, 396, 427, ... and is itself multiplicative in a sense that if a and b are fixed points, then also a*b is a fixed point.
The records are 0, 1, 3, 9, 19, 61, 281, 361, 843, 1159, 1811, 3721, 5339, 5433, 17141, 78961, 110471, 236883, 325679, ...
and they occur at positions 0, 1, 2, 4, 5, 7, 13, 25, 26, 35, 37, 49, 65, 74, 91, 169, 259, 338, 455, ...
(Note how the permutations map squares to squares, and in general keep the prime signature the same.)
Composition with similarly constructed A235199 gives the permutations A234743 & A234744 with more open cycle-structure.
The result of applying a permutation of the prime numbers to the prime factors of n. - Peter Munn, Dec 15 2019

			a(4) = a(2 * 2) = a(2)*a(2) = 3*3 = 9.
a(5) = a(p_3) = p_{a(3+1)-1} = p_{9-1} = p_8 = 19.
a(11) = a(p_5) = p_{a(5+1)-1} = p_{a(6)-1} = p_5 = 11.

Antti Karttunen, Table of n, a(n) for n = 0..16384
Index entries for sequences that are permutations of the natural numbers

List below gives similarly constructed permutations, which all force a swap of two small numbers, with (the rest of) primes permuted with the sequence itself and the new positions of composite numbers defined by the multiplicative property. Apart from the first one, all satisfy A000040(a(n)) = a(A000040(n)) except for a finite number of cases (with A235200, substitute A065091 for A000040):
A235200 (swaps 3 & 5).
A235199 (swaps 5 & 7).
A235201 (swaps 3 & 4).
A235487 (swaps 7 & 8).
A235489 (swaps 8 & 9).
Cf. A064614, A234743/A234744, A235485/A235486, A235493/A235494, also A317930.
Properties preserved by the sequence as a function: A000005, A001221, A001222, A051903, A101296.
A007913, A007947, A008578, A019554, A055231, A059895, A059896, A059897 are used to express relationships between terms of this sequence.

a[n_] := a[n] = Switch[n, 0, 0, 1, 1, 2, 3, 3, 2, _, Product[{p, e} = pe; Prime[a[PrimePi[p] + 1] - 1]^e, {pe, FactorInteger[n]}]];
Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 21 2021 *)

A234840(n) = if(n<=1,n,my(f = factor(n)); for(i=1, #f~, if(2==f[i,1], f[i,1]++, if(3==f[i,1], f[i,1]--, f[i,1] = prime(-1+A234840(1+primepi(f[i,1])))))); factorback(f)); \\ Antti Karttunen, Aug 23 2018

a(0) = 0, a(1) = 1, a(2) = 3, a(3) = 2, a(p_i) = p_{a(i+1)-1} for primes with index i > 2, and a(u * v) = a(u) * a(v) for u, v > 0.
From Peter Munn, Dec 14 2019. These identities would hold also if a(n) applied any other permutation of the prime numbers to the prime factors of n: (Start)
A000005(a(n)) = A000005(n).
A001221(a(n)) = A001221(n).
A001222(a(n)) = A001222(n).
A051903(a(n)) = A051903(n).
A101296(a(n)) = A101296(n).
a(A007913(n)) = A007913(a(n)).
a(A007947(n)) = A007947(a(n)).
a(A019554(n)) = A019554(a(n)).
a(A055231(n)) = A055231(a(n)).
a(A059895(n,k)) = A059895(a(n), a(k)).
a(A059896(n,k)) = A059896(a(n), a(k)).
a(A059897(n,k)) = A059897(a(n), a(k)).
(End)

A317929 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A235199, which is a multiplicative permutation of natural numbers.

Original entry on oeis.org

1, 1, 3, 3, 7, 3, 5, 5, 27, 7, 17, 9, 13, 5, 21, 35, 11, 27, 19, 21, 15, 17, 23, 15, 147, 13, 135, 15, 43, 21, 59, 63, 51, 11, 35, 81, 37, 19, 39, 35, 41, 15, 29, 51, 189, 23, 73, 105, 75, 147, 33, 39, 53, 135, 119, 25, 57, 43, 31, 63, 61, 59, 135, 231, 91, 51, 67, 33, 69, 35, 107, 135, 47, 37, 441, 57, 85, 39

Offset: 1

Antti Karttunen, Aug 23 2018

Multiplicative because A235199 is.

Question: Are all terms positive? No negative terms in range 1 .. 2^18. Also checked up to n = 2^18 that the denominators match with A299150.

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

Cf. A235199, A299150 (seems to give the denominators).

Cf. also A317930.

up_to = 16384;
A235199(n) = if(n<=4,n,my(f = factor(n)); for(i=1, #f~, if(5==f[i,1], f[i,1] += 2, if(7==f[i,1], f[i,1] -= 2, my(k=primepi(f[i,1])); if(k>4, f[i,1] = prime(A235199(k)))))); factorback(f));
DirSqrt(v) = {my(n=#v, u=vector(n)); u[1]=1; for(n=2, n, u[n]=(v[n]/v[1] - sumdiv(n, d, if(d>1&&dA317937.
v317929aux = DirSqrt(vector(up_to, n, A235199(n)));
A317929(n) = numerator(v317929aux[n]);

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A235199(n) - Sum_{d|n, d>1, d 1.

A318664 Numerators of the sequence whose Dirichlet convolution with itself yields A064664, the inverse permutation of EKG-sequence.

Original entry on oeis.org

1, 1, 5, 1, 5, -1, 7, 3, -1, -1, 10, 3, 14, -1, -7, 5, 33, 59, 37, 9, -10, -1, 43, -1, -1, -1, 181, 13, 57, 89, 61, 15, -29, -1, -45, 31, 67, -1, -41, 1, 37, 129, 81, 11, 301, -1, 89, 21, 1, 26, -97, 10, 50, -93, -47, -5, -109, -1, 107, -33, 115, -1, 411, 15, -43, 201, 64, 33, -127, 56, 67, 181, 69, -1, 283, 35, -31, 255, 151, 7

Offset: 1

Antti Karttunen, Sep 01 2018

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences related to EKG sequence

Cf. A064664, A304526, A304527, A305293, A305294, A318665 (denominators).

Cf. also A317929, A317930.

v064413 = readvec("b064413_upto65539_terms_only.txt"); \\ From b-file of A064413 prepared beforehand.
A064413(n) = v064413[n];
m064664 = Map();
for(n=1,65539,mapput(m064664,A064413(n),n));
A064664(n) = mapget(m064664,n);
up_to = (2^14);
DirSqrt(v) = {my(n=#v, u=vector(n)); u[1]=1; for(n=2, n, u[n]=(v[n]/v[1] - sumdiv(n, d, if(d>1&&dA317937.
v318664_65 = DirSqrt(vector(up_to, n, A064664(n)));
A318664(n) = numerator(v318664_65[n]);
A318665(n) = denominator(v318664_65[n]);

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A064664(n) - Sum_{d|n, d>1, d 1.

For n >= 2, a(2*A000040(n)) = -1.

cp's OEIS Frontend

A317932 Denominators of certain "Dirichlet Square Root" sequences: a(n) = A046644(n)/(2^A007949(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

PARI

Formula

Extensions

A234840 Self-inverse and multiplicative permutation of integers: a(0) = 0, a(1) = 1, a(2) = 3, a(3) = 2, a(p_i) = p_{a(i+1)-1} for primes with index i > 2, and a(u * v) = a(u) * a(v) for u, v > 0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A317929 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A235199, which is a multiplicative permutation of natural numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A318664 Numerators of the sequence whose Dirichlet convolution with itself yields A064664, the inverse permutation of EKG-sequence.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula