A324058 -id:A324058 - cp's OEIS frontend

A336320 Lexicographically earliest infinite sequence such that a(i) = a(j) => A324058(i) = A324058(j) for all i, j >= 0.

1, 1, 2, 1, 2, 3, 1, 1, 2, 2, 3, 4, 1, 5, 4, 1, 2, 6, 4, 7, 4, 8, 7, 3, 5, 5, 2, 1, 4, 8, 1, 5, 2, 4, 3, 9, 4, 10, 2, 11, 4, 12, 8, 8, 2, 13, 14, 4, 1, 5, 7, 1, 7, 3, 1, 5, 4, 4, 8, 6, 1, 5, 2, 1, 2, 2, 4, 3, 4, 10, 7, 6, 15, 6, 8, 16, 7, 8, 6, 2, 4, 12, 8, 17, 6, 18, 3, 14

Offset: 0

Antti Karttunen, Jul 19 2020

nonn

Restricted growth sequence transform of A324058.

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

Cf. A005940, A324121, A324058.

Cf. also A286622.

up_to = 65537;
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; };
A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A324121(n) = gcd(sigma(n),n*numdiv(n));
A324058(n) = A324121(A005940(1+n));
v336320 = rgs_transform(vector(1+up_to,n,A324058(n-1)));
A336320(n) = v336320[1+n];

A005940 The Doudna sequence: write n-1 in binary; power of prime(k) in a(n) is # of 1's that are followed by k-1 0's.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 9, 8, 7, 10, 15, 12, 25, 18, 27, 16, 11, 14, 21, 20, 35, 30, 45, 24, 49, 50, 75, 36, 125, 54, 81, 32, 13, 22, 33, 28, 55, 42, 63, 40, 77, 70, 105, 60, 175, 90, 135, 48, 121, 98, 147, 100, 245, 150, 225, 72, 343, 250, 375, 108, 625, 162, 243, 64, 17, 26, 39

Offset: 1

N. J. A. Sloane and J. H. Conway

A permutation of the natural numbers. - Robert G. Wilson v, Feb 22 2005
Fixed points: A029747. - Reinhard Zumkeller, Aug 23 2006
The even bisection, when halved, gives the sequence back. - Antti Karttunen, Jun 28 2014
From Antti Karttunen, Dec 21 2014: (Start)
This irregular table can be represented as a binary tree. Each child to the left is obtained by applying A003961 to the parent, and each child to the right is obtained by doubling the parent:
                                      1
                                      |
                   ...................2...................
                  3                                       4
        5......../ \........6                   9......../ \........8
       / \                 / \                 / \                 / \
      /   \               /   \               /   \               /   \
     /     \             /     \             /     \             /     \
    7       10         15       12         25       18         27       16
  11 14   21  20     35  30   45  24     49  50   75  36    125  54   81  32
etc.
Sequence A163511 is obtained by scanning the same tree level by level, from right to left. Also in binary trees A253563 and A253565 the terms on level of the tree are some permutation of the terms present on the level n of this tree. A252464(n) gives the distance of n from 1 in all these trees.
A252737(n) gives the sum and A252738(n) the product of terms on row n (where 1 is on row 0, 2 on row 1, 3 and 4 on row 2, etc.). A252745(n) gives the number of nodes on level n whose left child is larger than the right child, A252750 the difference between left and right child for each node from node 2 onward.
(End)
-A008836(a(1+n)) gives the corresponding numerator for A323505(n). - Antti Karttunen, Jan 19 2019
(a(2n+1)-1)/2 [= A244154(n)-1, for n >= 0] is a permutation of the natural numbers. - George Beck and Antti Karttunen, Dec 08 2019
From Peter Munn, Oct 04 2020: (Start)
Each term has the same even part (equivalently, the same 2-adic valuation) as its index.
Using the tree depicted in Antti Karttunen's 2014 comment:
Numbers are on the right branch (4 and descendants) if and only if divisible by the square of their largest prime factor (cf. A070003).
Numbers on the left branch, together with 2, are listed in A102750.
(End)
According to Kutz (1981), he learned of this sequence from American mathematician Byron Leon McAllister (1929-2017) who attributed the invention of the sequence to a graduate student by the name of Doudna (first name Paul?) in the mid-1950's at the University of Wisconsin. - Amiram Eldar, Jun 17 2021
From David James Sycamore, Sep 23 2022: (Start)
Alternative (recursive) definition: If n is a power of 2 then a(n)=n. Otherwise, if 2^j is the greatest power of 2 not exceeding n, and if k = n - 2^j, then a(n) is the least m*a(k) that has not occurred previously, where m is an odd prime.
Example: Use recursion with n = 77 = 2^6 + 13. a(13) = 25 and since 11 is the smallest odd prime m such that m*a(13) has not already occurred (see a(27), a(29),a(45)), then a(77) = 11*25 = 275. (End)
The odd bisection, when transformed by replacing all prime(k)^e in a(2*n - 1) with prime(k-1)^e, returns a(n), and thus gives the sequence back. - David James Sycamore, Sep 28 2022

			From _N. J. A. Sloane_, Aug 22 2022: (Start)
Let c_i = number of 1's in binary expansion of n-1 that have i 0's to their right, and let p(j) = j-th prime.  Then a(n) = Product_i p(i+1)^c_i.
If n=9, n-1 is 1000, c_3 = 1, a(9) = p(4)^1 = 7.
If n=10, n-1 = 1001, c_0 = 1, c_2 = 1, a(10) = p(1)*p(3) = 2*5 = 10.
If n=11, n-1 = 1010, c_1 = 1, c_2 = 1, a(11) = p(2)*p(3) = 15. (End)

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Antti Karttunen, Table of n, a(n) for n = 1..8192 (terms 1..1024 from Reinhard Zumkeller)
Michael De Vlieger, 6 row Doudna Tree diagram as mentioned in Comments.
Michael De Vlieger, Annotated fan-style binary tree showing 10 levels, with a color function where 2^m is shown in medium blue in row m, k < 2^m is darker blue, and k > 2^m is brighter green, with records in each row shown in red.
Ronald E. Kutz, Two unusual sequences, Two-Year College Mathematics Journal, Vol. 12, No. 5 (1981), pp. 316-319.
Index entries for sequences that are permutations of the natural numbers

Cf. A103969. Inverse is A005941 (A156552).
Cf. A125106. [From Franklin T. Adams-Watters, Mar 06 2010]
Cf. A252737 (gives row sums), A252738 (row products), A332979 (largest on row).
Related permutations of positive integers: A163511 (via A054429), A243353 (via A006068), A244154, A253563 (via A122111), A253565, A332977, A334866 (via A225546).
A000120, A003602, A003961, A006519, A053645, A070939, A246278, A250246, A252753, A253552 are used in a formula defining this sequence.
Formulas for f(a(n)) are given for f = A000265, A003963, A007949, A055396, A056239.
Numbers that occur at notable sets of positions in the binary tree representation of the sequence: A000040, A000079, A002110, A070003, A070826, A102750.
Cf. also A000142, A001511, A002450, A112798, A252463, A252464, A252745, A252750, A324054, A324106, A323505, A323508.
Cf. A106737, A290077, A323915, A324052, A324054, A324055, A324056, A324057, A324058, A324114, A324335, A324340, A324348, A324349 for various number-theoretical sequences applied to (i.e., permuted by) this sequence.
k-adic valuation: A007814 (k=2), A337821 (k=3).
Positions of multiples of 3: A091067.
Primorial deflation: A337376 / A337377.
Sum of prime indices of a(n) is A161511, reverse version A359043.
A048793 lists binary indices, ranked by A019565.
A066099 lists standard comps, partial sums A358134 (ranked by A358170).
Cf. A001222, A029837, A059893, A241916, A242628, A253566, A359042.

a005940 n = f (n - 1) 1 1 where
   f 0 y _          = y
   f x y i | m == 0 = f x' y (i + 1)
           | m == 1 = f x' (y * a000040 i) i
           where (x',m) = divMod x 2
-- Reinhard Zumkeller, Oct 03 2012
(Scheme, with memoization-macro definec from Antti Karttunen's IntSeq-library)
(define (A005940 n) (A005940off0 (- n 1))) ;; The off=1 version, utilizing any one of three different offset-0 implementations:
(definec (A005940off0 n) (cond ((< n 2) (+ 1 n)) (else (* (A000040 (- (A070939 n) (- (A000120 n) 1))) (A005940off0 (A053645 n))))))
(definec (A005940off0 n) (cond ((<= n 2) (+ 1 n)) ((even? n) (A003961 (A005940off0 (/ n 2)))) (else (* 2 (A005940off0 (/ (- n 1) 2))))))
(define (A005940off0 n) (let loop ((n n) (i 1) (x 1)) (cond ((zero? n) x) ((even? n) (loop (/ n 2) (+ i 1) x)) (else (loop (/ (- n 1) 2) i (* x (A000040 i)))))))
;; Antti Karttunen, Jun 26 2014

f := proc(n,i,x) option remember ; if n = 0 then x; elif type(n,'even') then procname(n/2,i+1,x) ; else procname((n-1)/2,i,x*ithprime(i)) ; end if; end proc:
A005940 := proc(n) f(n-1,1,1) ; end proc: # R. J. Mathar, Mar 06 2010

f[n_] := Block[{p = Partition[ Split[ Join[ IntegerDigits[n - 1, 2], {2}]], 2]}, Times @@ Flatten[ Table[q = Take[p, -i]; Prime[ Count[ Flatten[q], 0] + 1]^q[[1, 1]], {i, Length[p]}] ]]; Table[ f[n], {n, 67}] (* Robert G. Wilson v, Feb 22 2005 *)
Table[Times@@Prime/@(Join@@Position[Reverse[IntegerDigits[n,2]],1]-Range[DigitCount[n,2,1]]+1),{n,0,100}] (* Gus Wiseman, Dec 28 2022 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, n%2 && (t*=p) || p=nextprime(p+1)); t } \\ M. F. Hasler, Mar 07 2010; update Aug 29 2014

a(n)=my(p=2, t=1); for(i=0,exponent(n), if(bittest(n,i), t*=p, p=nextprime(p+1))); t \\ Charles R Greathouse IV, Nov 11 2021

from sympy import prime
import math
def A(n): return n - 2**int(math.floor(math.log(n, 2)))
def b(n): return n + 1 if n<2 else prime(1 + (len(bin(n)[2:]) - bin(n)[2:].count("1"))) * b(A(n))
print([b(n - 1) for n in range(1, 101)]) # Indranil Ghosh, Apr 10 2017

from math import prod
from itertools import accumulate
from collections import Counter
from sympy import prime
def A005940(n): return prod(prime(len(a)+1)**b for a, b in Counter(accumulate(bin(n-1)[2:].split('1')[:0:-1])).items()) # Chai Wah Wu, Mar 10 2023

From Reinhard Zumkeller, Aug 23 2006, R. J. Mathar, Mar 06 2010: (Start)
a(n) = f(n-1, 1, 1)
  where f(n, i, x) = x if n = 0,
                   = f(n/2, i+1, x) if n > 0 is even
                   = f((n-1)/2, i, x*prime(i)) otherwise. (End)
From Antti Karttunen, Jun 26 2014: (Start)
Define a starting-offset 0 version of this sequence as:
  b(0)=1, b(1)=2, [base cases]
and then compute the rest either with recurrence:
  b(n) = A000040(1+(A070939(n)-A000120(n))) * b(A053645(n)).
or
  b(2n) = A003961(b(n)), b(2n+1) = 2 * b(n). [Compare this to the similar recurrence given for A163511.]
Then define a(n) = b(n-1), where a(n) gives this sequence A005940 with the starting offset 1.
Can be also defined as a composition of related permutations:
a(n+1) = A243353(A006068(n)).
a(n+1) = A163511(A054429(n)). [Compare the scatter plots of this sequence and A163511 to each other.]
This permutation also maps between the partitions as enumerated in the lists A125106 and A112798, providing identities between:
A161511(n) = A056239(a(n+1)). [The corresponding sums ...]
A243499(n) = A003963(a(n+1)). [... and the products of parts of those partitions.]
(End)
From Antti Karttunen, Dec 21 2014  - Jan 04 2015: (Start)
A002110(n) =  a(1+A002450(n)). [Primorials occur at (4^n - 1)/3 in the offset-0 version of the sequence.]
a(n) = A250246(A252753(n-1)).
a(n) = A122111(A253563(n-1)).
For n >= 1, A055396(a(n+1)) = A001511(n).
For n >= 2, a(n) = A246278(1+A253552(n)).
(End)
From Peter Munn, Oct 04 2020: (Start)
A000265(a(n)) = a(A000265(n)) = A003961(a(A003602(n))).
A006519(a(n)) = a(A006519(n)) = A006519(n).
a(n) = A003961(a(A003602(n))) * A006519(n).
A007814(a(n)) = A007814(n).
A007949(a(n)) = A337821(n) = A007814(A003602(n)).
a(n) = A225546(A334866(n-1)).
(End)
a(2n) = 2*a(n), or generally a(2^k*n) = 2^k*a(n). - Amiram Eldar, Oct 03 2022
If n-1 = Sum_{i} 2^(q_i-1), then a(n) = Product_{i} prime(q_i-i+1). These are the Heinz numbers of the rows of A125106. If the offset is changed to 0, the inverse is A156552. - Gus Wiseman, Dec 28 2022

More terms from Robert G. Wilson v, Feb 22 2005
Sign in a formula switched and Maple program added by R. J. Mathar, Mar 06 2010
Binary tree illustration and keyword tabf added by Antti Karttunen, Dec 21 2014

A324054 a(n) = A000203(A005940(1+n)).

Original entry on oeis.org

1, 3, 4, 7, 6, 12, 13, 15, 8, 18, 24, 28, 31, 39, 40, 31, 12, 24, 32, 42, 48, 72, 78, 60, 57, 93, 124, 91, 156, 120, 121, 63, 14, 36, 48, 56, 72, 96, 104, 90, 96, 144, 192, 168, 248, 234, 240, 124, 133, 171, 228, 217, 342, 372, 403, 195, 400, 468, 624, 280, 781, 363, 364, 127, 18, 42, 56, 84, 84, 144, 156, 120, 112, 216, 288, 224

Offset: 0

Antti Karttunen, Feb 14 2019

nonn

As noted by David A. Corneth, the function f(n) = a(n-1) [that is, the offset-1 version of this sequence] seems to be "almost multiplicative". Sequence A324109 gives the positions n where f(n) satisfies the multiplicativity in a sense that f(n) = f(p(1)^e(1)) * ... * f(p(k)^e(k)), when n = p(1)^e(1) * ... * p(k)^e(k), and A324110 the positions where this does not hold.

Antti Karttunen, Table of n, a(n) for n = 0..8191
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..70327
Index entries for sequences related to binary expansion of n
Michael De Vlieger, Annotated fan-style binary tree diagram showing 16 levels, where blue represents A336834(n) = 1 and yellow A336834(n) = 0. Labels are a(n) for the 8 smallest levels.

Cf. A000203, A005940, A038712, A324055, A324056, A324057, A324058, A324108, A324109, A324110, A324111, A324112, A356321.

Cf. also A106737, A290077 (tau and phi similarly permuted).

nn = 76; a[0] = 1; Do[Set[a[n], Prime[1 + DigitCount[n, 2, 0]]*a[n - 2^Floor@ Log2@ n]], {n, nn}]; Array[DivisorSigma[1, a[#]] &, nn, 0] (* Michael De Vlieger, Aug 03 2022 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A324054(n) = sigma(A005940(1+n));

A324054(n) = { my(p=2,mp=p*p,m=1); while(n, if(!(n%2), p=nextprime(1+p); mp = p*p, if(3==(n%4),mp *= p,m *= (mp-1)/(p-1))); n>>=1); (m); };

from math import prod
from itertools import accumulate
from collections import Counter
from sympy import prime
def A324054(n): return prod(((p:=prime(len(a)+1))**(b+1)-1)//(p-1) for a, b in Counter(accumulate(bin(n)[2:].split('1')[:0:-1])).items()) # Chai Wah Wu, Mar 10 2023

a(n) = A000203(A005940(1+n)).

a(n) = A324056(n) * A038712(1+n).

A324055 Deficiency of Doudna-sequence: a(n) = A033879(A005940(1+n)).

Original entry on oeis.org

1, 1, 2, 1, 4, 0, 5, 1, 6, 2, 6, -4, 19, -3, 14, 1, 10, 4, 10, -2, 22, -12, 12, -12, 41, 7, 26, -19, 94, -12, 41, 1, 12, 8, 18, 0, 38, -12, 22, -10, 58, -4, 18, -48, 102, -54, 30, -28, 109, 25, 66, -17, 148, -72, 47, -51, 286, 32, 126, -64, 469, -39, 122, 1, 16, 10, 22, 4, 46, -12, 42, -8, 70, 4, 42, -56, 178, -60, 58, -26, 118, 20

Offset: 0

Antti Karttunen, Feb 14 2019

Both here and in the mirror image sequence A324185, the lowermost (asinh) scatter plot shows on the y = 0 line the numbers that correspond to the perfect numbers. Compare also to the scatter plot of A243492.

Antti Karttunen, Table of n, a(n) for n = 0..8192
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..70327
Index entries for sequences related to binary expansion of n
Index entries for sequences related to sigma(n)

Cf. A000120, A033879, A054429.
See A106737, A290077, A323915, A324052, A324054, A324056, A324057, A324058, A324114, A324335, A324340, A324348, A324349, A324394, A324395 for other sequences as permuted by A005940, and compare their scatter plots.
Cf. also A243492, A323174, A323244, A324185, A324346, A324347, A324654.

Array[Block[{p = Partition[Split[Join[IntegerDigits[#, 2], {2}]], 2]}, 2 # - DivisorSigma[1, #] &[Times @@ Flatten@ Table[Prime[Count[Flatten@ #, 0] + 1]^#[[1, 1]] &@ Take[p, -i], {i, Length[p]}]]] &, 82, 0] (* Michael De Vlieger, Mar 11 2019, after Robert G. Wilson v at A005940 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A033879(n) = (2*n-sigma(n));
A324055(n) = A033879(A005940(1+n));

A324055(n) = { my(m1=2,m2=1,p=2,mp=p*p); while(n, if(!(n%2), p=nextprime(1+p); mp = p*p, m1 *= p; if(3==(n%4),mp *= p,m2 *= (mp-1)/(p-1))); n>>=1); (m1-m2); };

a(n) = A033879(A005940(1+n)).
a(n) = 2*A005940(1+n) - A324054(n).
For n > 0, a(n) = A324185(A054429(n)).
a(n) = A324348(n) + A000120(A005940(1+n)).

A324121 a(n) = gcd(n*d(n), sigma(n)), where d(n) = number of divisors of n (A000005) and sigma(n) = sum of divisors of n (A000203).

Original entry on oeis.org

1, 1, 2, 1, 2, 12, 2, 1, 1, 2, 2, 4, 2, 8, 12, 1, 2, 3, 2, 6, 4, 4, 2, 12, 1, 2, 4, 56, 2, 24, 2, 3, 12, 2, 4, 1, 2, 4, 4, 10, 2, 48, 2, 12, 6, 8, 2, 4, 3, 3, 12, 2, 2, 24, 4, 8, 4, 2, 2, 24, 2, 8, 2, 1, 4, 48, 2, 6, 12, 16, 2, 3, 2, 2, 2, 4, 4, 24, 2, 2, 1, 2, 2, 112, 4, 4, 12, 4, 2, 18, 28, 24, 4, 8, 20, 36, 2, 3, 6, 1, 2, 24, 2, 2, 24

Offset: 1

Antti Karttunen, Feb 15 2019

nonn

Records 1, 2, 12, 56, 112, 120, 336, 720, 992, 2016, 4368, 8640, 14880, 16256, 26208, 59520, 78624, 120960, 131040, 191520, 227584, 297600, ... occur at positions: 1, 3, 6, 28, 84, 120, 140, 270, 496, 672, 1638, 2970, 6200, 8128, 8190, 18600, 27846, 30240, 32760, 55860, 105664, 117800, ... . Note that A001599 is not a subsequence of the latter, as at least 18620 (present in A001599) is missing.

Antti Karttunen, Table of n, a(n) for n = 1..10080
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..117800

Cf. A000005, A000203, A001599, A038040, A106315, A106316, A156552, A324045, A324046, A324047, A324058, A324122.

Table[GCD[n DivisorSigma[0,n],DivisorSigma[1,n]],{n,120}] (* Harvey P. Dale, Feb 17 2023 *)

PARI
```
A324121(n) = gcd(sigma(n),n*numdiv(n));
```

a(n) = gcd(A000203(n), A038040(n)).

a(n) = A324058(A156552(n)).

A324057 a(n) = A106315(A005940(1+n)).

Original entry on oeis.org

0, 1, 2, 5, 4, 0, 1, 2, 6, 4, 12, 16, 13, 30, 28, 18, 10, 8, 20, 36, 44, 24, 36, 12, 33, 21, 78, 51, 32, 72, 42, 3, 12, 16, 36, 0, 4, 48, 66, 50, 20, 128, 72, 48, 58, 144, 120, 108, 97, 75, 198, 32, 102, 312, 10, 84, 172, 128, 504, 176, 1, 168, 2, 67, 16, 20, 44, 12, 8, 96, 126, 88, 28, 16, 168, 112, 162, 264, 232, 56, 68, 80, 312, 0, 200, 480, 36, 120

Offset: 0

Antti Karttunen, Feb 14 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 0..8191
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..70327

Cf. A005940, A106737, A106315, A324054, A324055, A324058.

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A106315(n) = (n*numdiv(n) % sigma(n));
A324057(n) = A106315(A005940(1+n));

a(n) = A106315(A005940(1+n)).

a(n) = A005940(1+n)*A106737(n) mod A324054(n).

A323915 a(n) = A023900(A005940(1+n)).

Original entry on oeis.org

1, -1, -2, -1, -4, 2, -2, -1, -6, 4, 8, 2, -4, 2, -2, -1, -10, 6, 12, 4, 24, -8, 8, 2, -6, 4, 8, 2, -4, 2, -2, -1, -12, 10, 20, 6, 40, -12, 12, 4, 60, -24, -48, -8, 24, -8, 8, 2, -10, 6, 12, 4, 24, -8, 8, 2, -6, 4, 8, 2, -4, 2, -2, -1, -16, 12, 24, 10, 48, -20, 20, 6, 72, -40, -80, -12, 40, -12, 12, 4, 120, -60, -120, -24, -240, 48, -48

Offset: 0

Antti Karttunen, Feb 22 2019

sign

Antti Karttunen, Table of n, a(n) for n = 0..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537
Index entries for sequences related to binary expansion of n

Cf. A005940, A023900, A290077, A324052, A324054, A324055, A324057, A324058.

A323915(n) = { my(m1=1, p=2); while(n, if(!(n%2), p=nextprime(1+p), if(1==(n%4), m1 *= (1-p))); n>>=1); (m1); };

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A023900(n) = sumdivmult(n, d, d*moebius(d)); \\ From A023900
A323915(n) = A023900(A005940(1+n));

a(n) = A023900(A005940(1+n)).

A324188 a(n) = A324121(A163511(n)).

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 12, 2, 1, 4, 3, 1, 4, 12, 2, 2, 3, 1, 24, 4, 1, 2, 3, 3, 12, 6, 24, 4, 6, 4, 8, 2, 1, 2, 3, 1, 8, 24, 4, 4, 3, 1, 12, 6, 1, 6, 3, 1, 4, 120, 18, 2, 24, 24, 16, 4, 10, 2, 48, 4, 56, 12, 4, 2, 1, 1, 12, 6, 1, 2, 1, 1, 24, 12, 48, 40, 12, 8, 16, 4, 1, 20, 3, 3, 4, 36, 6, 14, 15, 3, 36, 6, 21, 2, 3, 3, 36, 6, 720, 8, 6, 4, 24, 6, 120, 12

Offset: 0

Antti Karttunen, Feb 17 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 0..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537

Cf. A054429, A324058, A163511, A324121, A324183, A324184, A324187, A324189.

A163511(n) = if(!n,1,my(p=2, t=1); while(n>1, if(!(n%2), (t*=p), p=nextprime(1+p)); n >>= 1); (t*p));
A324121(n) = gcd(sigma(n),n*numdiv(n));
A324188(n) = A324121(A163511(n));

A324183(n) = if(!n,1,n = ((3<<#binary(n\2))-n-1); my(e=0,m=1); while(n>0, if(!(n%2), m *= (1+e); e=0, e++); n >>= 1); (m*(1+e)));
A324184(n) = if(!n,1,my(p=2,mp=p*p,m=1); while(n>1, if(n%2, p=nextprime(1+p); mp = p*p, if((2==n)||!(n%4),mp *= p,m *= (mp-1)/(p-1))); n >>= 1); (m*(mp-1)/(p-1)));
A324188(n) = gcd(A324184(n), A163511(n)*A324183(n));

a(n) = A324121(A163511(n)) = gcd(A324184(n), A163511(n)*A324183(n)).

For n > 0, a(n) = A324058(A054429(n)).

A324349 a(n) = A324122(A005940(1+n)), where A005940 is the Doudna sequence and A324122(n) = sigma(n) - gcd(n*d(n), sigma(n)).

Original entry on oeis.org

0, 2, 2, 6, 4, 0, 12, 14, 6, 16, 12, 24, 30, 36, 36, 30, 10, 16, 28, 36, 44, 48, 72, 48, 54, 90, 122, 90, 152, 96, 120, 60, 12, 32, 36, 0, 68, 48, 102, 80, 92, 128, 168, 144, 246, 216, 120, 120, 132, 168, 222, 216, 336, 360, 402, 192, 396, 464, 600, 272, 780, 360, 362, 126, 16, 40, 52, 72, 80, 96, 150, 112, 84, 208, 264, 112, 366, 288, 312, 184, 164, 272, 360, 0, 568

Offset: 0

Antti Karttunen, Feb 24 2019

nonn

Zeros occur in the same positions as in A324057, and can be obtained by sorting into ascending order the terms obtained with A156552(A001599(n)), n >= 1.

Antti Karttunen, Table of n, a(n) for n = 0..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537

Cf. A005940, A054429, A324054, A324057, A324058, A324189

Cf. also A001599.

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A324122(n) = (sigma(n) - gcd(sigma(n),n*numdiv(n)));
A324349(n)  = A324122(A005940(1+n));

a(n) = A324122(A005940(1+n)).
a(n) = A324054(n) - A324058(n).
For n > 0, a(n) = A324189(A054429(n)).

A324394 a(n) = A009194(A005940(1+n)), where A005940 is the Doudna sequence and A009194(n) = gcd(n,sigma(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 3, 4, 1, 3, 1, 1, 1, 2, 1, 2, 1, 6, 3, 12, 1, 1, 1, 1, 1, 6, 1, 1, 1, 2, 3, 28, 1, 6, 1, 10, 1, 2, 3, 12, 1, 18, 15, 4, 1, 1, 3, 1, 1, 6, 1, 3, 1, 2, 3, 4, 1, 3, 1, 1, 1, 2, 1, 4, 1, 6, 3, 8, 7, 2, 3, 28, 1, 6, 1, 2, 1, 2, 3, 28, 1, 6, 3, 120, 1, 2, 1, 6, 1, 90, 3, 12, 1, 1, 1, 7, 1, 6, 3, 5, 7, 2

Offset: 0

Antti Karttunen, Mar 05 2019

nonn

Antti Karttunen, Table of n, a(n) for n = 0..16384
Antti Karttunen, Data supplement: n, a(n) computed for n = 0..65537
Index entries for sequences related to binary expansion of n
Index entries for sequences related to sigma(n)

Cf. A009194, A324054, A324055, A324058, A324349, A324395.

A324394(n) = { my(m1=1,m2=1,p=2,mp=p*p); while(n, if(!(n%2), p=nextprime(1+p); mp = p*p, m1 *= p; if(3==(n%4),mp *= p,m2 *= (mp-1)/(p-1))); n>>=1); gcd(m1,m2); };

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t }; \\ From A005940
A009194(n) = gcd(n, sigma(n));
A324394(n) = A009194(A005940(1+n));

a(n) = A009194(A005940(1+n)) = gcd(A005940(1+n), A324054(n)).

cp's OEIS Frontend

A336320 Lexicographically earliest infinite sequence such that a(i) = a(j) => A324058(i) = A324058(j) for all i, j >= 0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

A005940 The Doudna sequence: write n-1 in binary; power of prime(k) in a(n) is # of 1's that are followed by k-1 0's.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

Python

Python

Formula

Extensions

A324054 a(n) = A000203(A005940(1+n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Python

Formula

A324055 Deficiency of Doudna-sequence: a(n) = A033879(A005940(1+n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A324121 a(n) = gcd(n*d(n), sigma(n)), where d(n) = number of divisors of n (A000005) and sigma(n) = sum of divisors of n (A000203).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A324057 a(n) = A106315(A005940(1+n)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A323915 a(n) = A023900(A005940(1+n)).

Views

Author

Keywords

Links

Crossrefs