A134683 -id:A134683 - cp's OEIS frontend

A048675 If n = p_i^e_i * ... * p_k^e_k, p_i < ... < p_k primes (with p_i = prime(i)), then a(n) = (1/2) * (e_i * 2^i + ... + e_k * 2^k).

0, 1, 2, 2, 4, 3, 8, 3, 4, 5, 16, 4, 32, 9, 6, 4, 64, 5, 128, 6, 10, 17, 256, 5, 8, 33, 6, 10, 512, 7, 1024, 5, 18, 65, 12, 6, 2048, 129, 34, 7, 4096, 11, 8192, 18, 8, 257, 16384, 6, 16, 9, 66, 34, 32768, 7, 20, 11, 130, 513, 65536, 8, 131072, 1025, 12, 6, 36, 19

Offset: 1

Antti Karttunen, Jul 14 1999

nonn

The original motivation for this sequence was to encode the prime factorization of n in the binary representation of a(n), each such representation being unique as long as this map is restricted to A005117 (squarefree numbers, resulting a permutation of nonnegative integers A048672) or any of its subsequence, resulting an injective function like A048623 and A048639.
However, also the restriction to A260443 (not all terms of which are squarefree) results a permutation of nonnegative integers, namely A001477, the identity permutation.
When a polynomial with nonnegative integer coefficients is encoded with the prime factorization of n (e.g., as in A206296, A260443), then a(n) gives the evaluation of that polynomial at x=2.
The primitive completely additive integer sequence that satisfies a(n) = a(A225546(n)), n >= 1. By primitive, we mean that if b is another such sequence, then there is an integer k such that b(n) = k * a(n) for all n >= 1. - Peter Munn, Feb 03 2020
If the binary rank of an integer partition y is given by Sum_i 2^(y_i-1), and the Heinz number is Product_i prime(y_i), then a(n) is the binary rank of the integer partition with Heinz number n. Note the function taking a set s to Sum_i 2^(s_i-1) is the inverse of A048793 (binary indices), and the function taking a multiset m to Product_i prime(m_i) is the inverse of A112798 (prime indices). - Gus Wiseman, May 22 2024

			From _Gus Wiseman_, May 22 2024: (Start)
The A018819(7) = 6 cases of binary rank 7 are the following, together with their prime indices:
   30: {1,2,3}
   40: {1,1,1,3}
   54: {1,2,2,2}
   72: {1,1,1,2,2}
   96: {1,1,1,1,1,2}
  128: {1,1,1,1,1,1,1}
(End)

Antti Karttunen, Table of n, a(n) for n = 1..1024
Hans Havermann, Factorization of the first 10000 terms, in format [[primes], [exponents]]

Row 2 of A104244.
Similar logarithmic functions: A001414, A056239, A090880, A289506, A293447.
Left inverse of the following sequences: A000079, A019565, A038754, A068911, A134683, A260443, A332824.
A003961, A028234, A032742, A055396, A064989, A067029, A225546, A297845 are used to express relationship between terms of this sequence.
Cf. also A048623, A048676, A099884, A277896 and tables A277905, A285325.
Cf. A297108 (Möbius transform), A332813 and A332823 [= a(n) mod 3].
Pairs of sequences (f,g) that satisfy a(f(n)) = g(n), possibly with offset change: (A000203,A331750), (A005940,A087808), (A007913,A248663), (A007947,A087207), (A097248,A048675), (A206296,A000129), (A248692,A056239), (A283477,A005187), (A284003,A006068), (A285101,A028362), (A285102,A068052), (A293214,A001065), (A318834,A051953), (A319991,A293897), (A319992,A293898), (A320017,A318674), (A329352,A069359), (A332461,A156552), (A332462,A156552), (A332825,A000010) and apparently (A163511,A135529).
See comments/formulas in A277333, A331591, A331740 giving their relationship to this sequence.
The formula section details how the sequence maps the terms of A329050, A329332.
A277892, A322812, A322869, A324573, A324575 give properties of the n-th term of this sequence.
The term k appears A018819(k) times.
The inverse transformation is A019565 (Heinz number of binary indices).
The version for distinct prime indices is A087207.
Numbers k such that a(k) is prime are A277319, counts A372688.
Grouping by image gives A277905.
A014499 lists binary indices of prime numbers.
A061395 gives greatest prime index, least A055396.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Binary indices:
- listed A048793, sum A029931
- reversed A272020
- opposite A371572, sum A230877
- length A000120, complement A023416
- min A001511, opposite A000012
- max A070939, opposite A070940
- complement A368494, sum A359400
- opposite complement A371571, sum A359359
Cf. A000720, A035100, A071814, A096111, A225620, A243055, A304818, A355536, A358136, A372890.
Cf. A087207, A097248.

nthprime := proc(n) local i; if(isprime(n)) then for i from 1 to 1000000 do if(ithprime(i) = n) then RETURN(i); fi; od; else RETURN(0); fi; end; # nthprime(2) = 1, nthprime(3) = 2, nthprime(5) = 3, etc. - this is also A049084.
A048675 := proc(n) local s,d; s := 0; for d in ifactors(n)[ 2 ] do s := s + d[ 2 ]*(2^(nthprime(d[ 1 ])-1)); od; RETURN(s); end;
# simpler alternative
f:= n -> add(2^(numtheory:-pi(t[1])-1)*t[2], t=ifactors(n)[2]):
map(f, [$1..100]); # Robert Israel, Oct 10 2016

a[1] = 0; a[n_] := Total[ #[[2]]*2^(PrimePi[#[[1]]]-1)& /@ FactorInteger[n] ]; Array[a, 100] (* Jean-François Alcover, Mar 15 2016 *)

a(n) = my(f = factor(n)); sum(k=1, #f~, f[k,2]*2^primepi(f[k,1]))/2; \\ Michel Marcus, Oct 10 2016

\\ The following program reconstructs terms (e.g. for checking purposes) from the factorization file prepared by Hans Havermann:
v048675sigs = readvec("a048675.txt");
A048675(n) = if(n<=2,n-1,my(prsig=v048675sigs[n],ps=prsig[1],es=prsig[2]); prod(i=1,#ps,ps[i]^es[i])); \\ Antti Karttunen, Feb 02 2020

from sympy import factorint, primepi
def a(n):
    if n==1: return 0
    f=factorint(n)
    return sum([f[i]*2**(primepi(i) - 1) for i in f])
print([a(n) for n in range(1, 51)]) # Indranil Ghosh, Jun 19 2017

a(1) = 0, a(n) = 1/2 * (e1*2^i1 + e2*2^i2 + ... + ez*2^iz) if n = p_{i1}^e1*p_{i2}^e2*...*p_{iz}^ez, where p_i is the i-th prime. (e.g. p_1 = 2, p_2 = 3).
Totally additive with a(p^e) = e * 2^(PrimePi(p)-1), where PrimePi(n) = A000720(n). [Missing factor e added to the comment by Antti Karttunen, Jul 29 2015]
From Antti Karttunen, Jul 29 2015: (Start)
a(1) = 0; for n > 1, a(n) = 2^(A055396(n)-1) + a(A032742(n)). [Where A055396(n) gives the index of the smallest prime dividing n and A032742(n) gives the largest proper divisor of n.]
a(1) = 0; for n > 1, a(n) = (A067029(n) * (2^(A055396(n)-1))) + a(A028234(n)).
Other identities. For all n >= 0:
a(A019565(n)) = n.
a(A260443(n)) = n.
a(A206296(n)) = A000129(n).
a(A005940(n+1)) = A087808(n).
a(A007913(n)) = A248663(n).
a(A007947(n)) = A087207(n).
a(A283477(n)) = A005187(n).
a(A284003(n)) = A006068(n).
a(A285101(n)) = A028362(1+n).
a(A285102(n)) = A068052(n).
Also, it seems that a(A163511(n)) = A135529(n) for n >= 1. (End)
a(1) = 0, a(2n) = 1+a(n), a(2n+1) = 2*a(A064989(2n+1)). - Antti Karttunen, Oct 11 2016
From Peter Munn, Jan 31 2020: (Start)
a(n^2) = a(A003961(n)) = 2 * a(n).
a(A297845(n,k)) = a(n) * a(k).
a(n) = a(A225546(n)).
a(A329332(n,k)) = n * k.
a(A329050(n,k)) = 2^(n+k).
(End)
From Antti Karttunen, Feb 02-25 2020, Feb 01 2021: (Start)
a(n) = Sum_{d|n} A297108(d) = Sum_{d|A225546(n)} A297108(d).
a(n) = a(A097248(n)).
For n >= 2:
A001221(a(n)) = A322812(n), A001222(a(n)) = A277892(n).
A000203(a(n)) = A324573(n), A033879(a(n)) = A324575(n).
For n >= 1, A331750(n) = a(A000203(n)).
For n >= 1, the following chains hold:
A293447(n) >= a(n) >= A331740(n) >= A331591(n).
a(n) >= A087207(n) >= A248663(n).
(End)
a(n) = A087207(A097248(n)). - Flávio V. Fernandes, Jul 16 2025

Entry revised by Antti Karttunen, Jul 29 2015

More linking formulas added by Antti Karttunen, Apr 18 2017

A223541 Array T(m,n) = nim-product(2^m,2^n) (m>=0, n>=0) read by antidiagonals.

Original entry on oeis.org

1, 2, 2, 4, 3, 4, 8, 8, 8, 8, 16, 12, 6, 12, 16, 32, 32, 11, 11, 32, 32, 64, 48, 64, 13, 64, 48, 64, 128, 128, 128, 128, 128, 128, 128, 128, 256, 192, 96, 192, 24, 192, 96, 192, 256, 512, 512, 176, 176, 44, 44, 176, 176, 512, 512, 1024, 768

Offset: 0

Tilman Piesk, Mar 21 2013

Nimber multiplication is commutative, so this array is symmetric, and can be represented in a more compact way by the rows of the lower triangle (A223540).
The diagonal is A006017 (nim-squares of powers of 2).
The elements of this array are listed in A223543. In the key-matrix A223542 the entries of this array (which become very large) are replaced by the corresponding index numbers of A223543. (Surprisingly, the key-matrix seems to be interesting on its own.)
The number of different entries per antidiagonal is probably A002487. That would mean that there are exactly A002487(n+1) numbers that can be expressed as a nim-product(2^a,2^b) with a+b=n. - Tilman Piesk, Mar 27 2013

			T(1,7) = T(3,5) = 192, the result of the nim-multiplications 2^1*2^7 and 2^3*2^5.
The array begins:
1,2,4,8,16,32,64,128,256,...
2,3,8,12,32,48,128,192,512,...
4,8,6,11,64,128,96,176,1024,...
8,12,11,13,128,192,176,208,2048,...
16,32,64,128,24,44,75,141,4096,...
32,48,128,192,44,52,141,198,8192,...
64,128,96,176,75,141,103,185,16384,...
128,192,176,208,141,198,185,222,32768,...
256,512,1024,2048,4096,8192,16384,32768,384,...
...

J. H. Conway, "Integral lexicographic codes." Discrete Mathematics 83.2-3 (1990): 219-235. See Table 4.

Tilman Piesk, First 128 rows of the matrix, flattened
Tilman Piesk, Elements of dual matrix (256 SVGs)
Tilman Piesk, Walsh permutation; nimber multiplication (Wikiversity)
Tilman Piesk, Class bin and function nimprod (MATLAB code)

Cf. A051775, A223540, A006017 (main diagonal), A223543, A223542, A000079, A002487.

For rows 1,2,3,4, see A134683, A335159, A335160, A335161.

T(m,n) = A051775(A000079(m),A000079(n)).

T(m,n) = A223543(A223542(m,n)).

Edited by N. J. A. Sloane, Jun 08 2020

A214281 Triangle by rows, row n contains the ConvOffs transform of the first n terms of 1, 1, 3, 2, 5, 3, 7, ... (A026741 without leading zero).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 2, 6, 2, 1, 1, 5, 10, 10, 5, 1, 1, 3, 15, 10, 15, 3, 1, 1, 7, 21, 35, 35, 21, 7, 1, 1, 4, 28, 28, 70, 28, 28, 4, 1, 1, 9, 36, 84, 126, 126, 84, 36, 9, 1, 1, 5, 45, 60, 210, 126, 210, 60, 45, 5, 1, 1, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11, 1

Offset: 0

Gary W. Adamson, Jul 09 2012

The ConvOffs transform of a sequence s(0), s(1), ..., s(t-1) is defined by a(0)=1 and a(n) = a(n-1)*s(t-n)/s(n-1) for 1 <= n < t. An example of this process is also shown in the Narayana triangle, A001263. By increasing the length t of the input sequence (here: A026741) we create more and more rows of the triangle.

			First few rows of the triangle:
  1;
  1,  1;
  1,  1,  1;
  1,  3,  3,   1;
  1,  2,  6,   2,   1;
  1,  5, 10,  10,   5,   1;
  1,  3, 15,  10,  15,   3,   1;
  1,  7, 21,  35,  35,  21,   7,   1;
  1,  4, 28,  28,  70,  28,  28,   4,   1;
  1,  9, 36,  84, 126, 126,  84,  36,   9,  1;
  1,  5, 45,  60, 210, 126, 210,  60,  45,  5,  1;
  1, 11, 55, 165, 330, 462, 462, 330, 165, 55, 11, 1;
  ...

Tom Edgar and Michael Z. Spivey, Multiplicative functions, generalized binomial coefficients, and generalized Catalan numbers, Journal of Integer Sequences, Vol. 19 (2016), Article 16.1.6.

Cf. A134683 (row sums), A026741, A001263.

T(n,k) = binomial(n,k) if n is odd.

A223537 Compressed nim-multiplication table read by antidiagonals.

Original entry on oeis.org

1, 2, 2, 4, 3, 8, 8, 8, 12, 12, 16, 12, 5, 4, 192, 32, 32, 10, 10, 64, 64, 64, 48, 128, 15, 160, 128, 240, 128, 128, 192, 192, 240, 240, 80, 80, 256, 192, 80, 64, 17, 80, 96, 160, 20480, 512, 512, 160, 160, 34, 34, 176, 176, 40960, 40960, 1024

Offset: 0

Tilman Piesk, Mar 21 2013

A nim-multiplication table (A051775) of size 2^2^n can be compressed to a matrix of size 2^n, using Walsh permutations. As the nim-multiplication tables are submatrices to the bigger ones, also the compressions are submatrices to the bigger ones, leading to this infinite array.
This array is closely related to the nim-multiplication table powers of 2 (A223541). Both arrays can be seen as different views of the same cubic binary tensor.
The diagonal is A001317 (Sierpinski triangle rows read like binary numbers).
The elements of this array are listed in A223539. In the key-matrix A223538 the entries of this array (which become very large) are replaced by the corresponding index numbers of A223539. (Surprisingly, the key-matrix seems to be interesting on its own.)

Tilman Piesk, First 128 rows of the matrix, flattened
Tilman Piesk, Elements of dual matrix (256 SVGs)
Tilman Piesk, Walsh permutation; nimber multiplication (Wikiversity)
Tilman Piesk, MATLAB functions cv2cm and cm2cv

Cf. A051775, A223541, A001317, A223539, A223538.

a(m,n) = A223539( A223538(m,n) ).
a(n,n) = A001317(n).
a(1,n) = A134683(n+1).

cp's OEIS Frontend

A048675 If n = p_i^e_i * ... * p_k^e_k, p_i < ... < p_k primes (with p_i = prime(i)), then a(n) = (1/2) * (e_i * 2^i + ... + e_k * 2^k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

Python

Formula

Extensions

A223541 Array T(m,n) = nim-product(2^m,2^n) (m>=0, n>=0) read by antidiagonals.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Formula

Extensions

A214281 Triangle by rows, row n contains the ConvOffs transform of the first n terms of 1, 1, 3, 2, 5, 3, 7, ... (A026741 without leading zero).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A223537 Compressed nim-multiplication table read by antidiagonals.

Views

Author

Keywords

Comments

Links

Crossrefs

Formula