A138534 -id:A138534 - cp's OEIS frontend

A346043 a(n) is the position of A138534(n) in A025487.

1, 2, 6, 17, 67, 166, 676, 1373, 4475, 10446, 30036, 51032, 196386, 315302, 737515, 1654229, 4227565, 6301902, 17975187, 26010425, 70085244, 133337963

Offset: 0

Amiram Eldar, Jul 02 2021

			A138534(2) = A025487(6) = 12, so a(2) = 6.

Cf. A025487, A138534.

Similar sequences: A098718, A098719, A293635, A306802.

lps = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]; s = {}; Do[p = Position[lps, Product[Prime[k]^Floor[n/k], {k, 1, n}]]; If[p == {}, Break[]]; AppendTo[s, p[[1, 1]]], {n, 0, 20}]; s

f(m) = my(c=1, p, q=2, v=vector(logint(m, 2), i, 2^i), w); while(#v, c+=#v; p=q; q=nextprime(q+1); w=List([]); for(i=1, #v, for(j=1, min(valuation(v[i], p), logint(m\v[i], q)), listput(w, v[i]*q^j))); v=w); c;
a(n) = f(prod(k=1, n, prime(k)^(n\k))); \\ Jinyuan Wang, Jul 08 2021

A025487(a(n)) = A138534(n).

a(20)-a(21) from Jinyuan Wang, Jul 08 2021

A346044 Decimal expansion of Sum_{k>=0} 1/A138534(k).

Original entry on oeis.org

1, 5, 9, 1, 8, 7, 4, 1, 2, 1, 9, 3, 0, 1, 2, 5, 0, 1, 1, 2, 4, 1, 6, 2, 9, 5, 9, 8, 0, 9, 2, 1, 6, 0, 8, 5, 9, 0, 8, 5, 6, 6, 8, 4, 2, 8, 5, 8, 4, 6, 4, 7, 3, 3, 5, 0, 6, 4, 8, 9, 9, 4, 7, 9, 7, 0, 0, 0, 9, 8, 4, 6, 3, 5, 8, 4, 2, 5, 7, 4, 4, 2, 2, 3, 0, 5, 2, 2, 4, 2, 3, 4, 5, 3, 0, 7, 9, 9, 7, 2

Offset: 1

Amiram Eldar, Jul 02 2021

This constant is irrational (Mingarelli, 2013).

			1.59187412193012501124162959809216085908566842858464...

Angelo B. Mingarelli, Abstract factorials, Notes on Number Theory and Discrete Mathematics, Vol. 19, No. 4 (2013), pp. 43-76 (see p. 62); arXiv preprint, arXiv:0705.4299 [math.NT], 2007-2012.

Cf. A138534, A161360.

RealDigits[Sum[1/Product[Prime[k]^Floor[n/k], {k, 1, n}], {n, 0, 50}], 10, 100][[1]]

A215366 Triangle T(n,k) read by rows in which n-th row lists in increasing order all partitions lambda of n encoded as Product_{i in lambda} prime(i); n>=0, 1<=k<=A000041(n).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 7, 9, 10, 12, 16, 11, 14, 15, 18, 20, 24, 32, 13, 21, 22, 25, 27, 28, 30, 36, 40, 48, 64, 17, 26, 33, 35, 42, 44, 45, 50, 54, 56, 60, 72, 80, 96, 128, 19, 34, 39, 49, 52, 55, 63, 66, 70, 75, 81, 84, 88, 90, 100, 108, 112, 120, 144, 160, 192, 256

Offset: 0

Alois P. Heinz, Aug 08 2012

The concatenation of all rows (with offset 1) gives a permutation of the natural numbers A000027 with fixed points 1-6, 9, 10, 14, 15, 21, 22, 33, 49, 1095199, ... and inverse permutation A215501.
Number m is positioned in row n = A056239(m).  The number of different values m, such that both m and m+1 occur in row n is A088850(n).  A215369 lists all values m, such that both m and m+1 are in the same row.
The power prime(i)^j of the i-th prime is in row i*j for j in {0,1,2, ... }.
Column k=2 contains the even semiprimes A100484, where 10 and 22 are replaced by the odd semiprimes 9 and 21, respectively.
This triangle is related to the triangle A145518, see in both triangles the first column, the right border, the second right border and the row sums. - Omar E. Pol, May 18 2015

			The partitions of n=3 are {[3], [2,1], [1,1,1]}, encodings give {prime(3), prime(2)*prime(1), prime(1)^3} = {5, 3*2, 2^3} => row 3 = [5, 6, 8].
For n=0 the empty partition [] gives the empty product 1.
Triangle T(n,k) begins:
   1;
   2;
   3,  4;
   5,  6,  8;
   7,  9, 10, 12, 16;
  11, 14, 15, 18, 20, 24, 32;
  13, 21, 22, 25, 27, 28, 30, 36, 40, 48, 64;
  17, 26, 33, 35, 42, 44, 45, 50, 54, 56, 60, 72, 80, 96, 128;
  ...
Corresponding triangle of integer partitions begins:
  ();
  1;
  2, 11;
  3, 21, 111;
  4, 22, 31, 211, 1111;
  5, 41, 32, 221, 311, 2111, 11111;
  6, 42, 51, 33, 222, 411, 321, 2211, 3111, 21111, 111111;
  7, 61, 52, 43, 421, 511, 322, 331, 2221, 4111, 3211, 22111, 31111, 211111, 1111111;  - _Gus Wiseman_, Dec 12 2016

Column k=1 gives: A008578(n+1).
Last elements of rows give: A000079.
Second to last elements of rows give: A007283(n-2) for n>1.
Row sums give: A145519.
Row lengths are: A000041.
Cf. A129129 (with row elements using order of A080577).
LCM of terms in row n gives A138534(n).
Cf. A000027, A000040, A056239, A063008, A088850, A100484, A215501.
Cf. A112798, A246867 (the same for partitions into distinct parts).
Cf. A324939, A377852, A378175.

b:= proc(n, i) option remember; `if`(n=0 or i<2, [2^n],
       [seq(map(p->p*ithprime(i)^j, b(n-i*j, i-1))[], j=0..n/i)])
    end:
T:= n-> sort(b(n, n))[]:
seq(T(n), n=0..10);
# (2nd Maple program)
with(combinat): A := proc (n) local P, A, i: P := partition(n): A := {}; for i to nops(P) do A := `union`(A, {mul(ithprime(P[i][j]), j = 1 .. nops(P[i]))}) end do: A end proc; # the command A(m) yields row m. # Emeric Deutsch, Jan 23 2016
# (3rd Maple program)
q:= 7: S[0] := {1}: for m to q do S[m] := `union`(seq(map(proc (f) options operator, arrow: ithprime(j)*f end proc, S[m-j]), j = 1 .. m)) end do; # for a given positive integer q, the program yields rows 0, 1, 2,...,q. # Emeric Deutsch, Jan 23 2016

b[n_, i_] := b[n, i] = If[n == 0 || i<2, {2^n}, Table[Function[#*Prime[i]^j] /@ b[n - i*j, i-1], {j, 0, n/i}] // Flatten]; T[n_] := Sort[b[n, n]]; Table[T[n], {n, 0, 10}] // Flatten (* Jean-François Alcover, Mar 12 2015, after Alois P. Heinz *)
nn=7;HeinzPartition[n_]:=If[n===1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]//Reverse];
Take[GatherBy[Range[2^nn],Composition[Total,HeinzPartition]],nn+1] (* Gus Wiseman, Dec 12 2016 *)
Table[Map[Times @@ Prime@ # &, IntegerPartitions[n]], {n, 0, 8}] // Flatten (* Michael De Vlieger, Jul 12 2017 *)

\\ From M. F. Hasler, Dec 06 2016 (Start)
A215366_row(n)=vecsort([vecprod([prime(p)|p<-P])|P<-partitions(n)]) \\ bug fix & syntax update by M. F. Hasler, Oct 20 2023
A215366_vec(N)=concat(apply(A215366_row,[0..N])) \\ "flattened" rows 0..N (End)

Recurrence relation, explained for the set S(4) of entries in row 4: multiply the entries of S(3) by 2 (= 1st prime), multiply the entries of S(2) by 3 (= 2nd prime), multiply the entries of S(1) by 5 (= 3rd prime), multiply the entries of S(0) by 7 (= 4th prime); take the union of all the obtained products. The 3rd Maple program is based on this recurrence relation. - Emeric Deutsch, Jan 23 2016

A212166 Numbers k such that the maximum exponent in its prime factorization equals the number of positive exponents (A051903(k) = A001221(k)).

Original entry on oeis.org

1, 2, 3, 5, 7, 11, 12, 13, 17, 18, 19, 20, 23, 28, 29, 31, 36, 37, 41, 43, 44, 45, 47, 50, 52, 53, 59, 61, 63, 67, 68, 71, 73, 75, 76, 79, 83, 89, 92, 97, 98, 99, 100, 101, 103, 107, 109, 113, 116, 117, 120, 124, 127, 131, 137, 139, 147, 148, 149, 151, 153

Offset: 1

Matthew Vandermast, May 22 2012

			36 = 2^2*3^2 has 2 positive exponents in its prime factorization. The maximal exponent in its prime factorization is also 2. Therefore, 36 belongs to this sequence.

M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 844.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Primefan, The First 2500 Integers Factored (first of 5 pages).

Includes subsequences A000040, A006939, A138534, A181555, A181825.
See also A212164, A212165, A212167, A212168.
Cf. A001221, A050326, A051903, A188654 (complement), A225230.

import Data.List (elemIndices)
a212166 n = a212166_list !! (n-1)
a212166_list = map (+ 1) $ elemIndices 0 a225230_list
-- Reinhard Zumkeller, May 03 2013

okQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Max[f] == Length[f]]; Select[Range[424], okQ] (* T. D. Noe, May 24 2012 *)

is(k) = {my(e = factor(k)[, 2]); !(#e) || vecmax(e) == #e;} \\ Amiram Eldar, Sep 08 2024

A225230(a(n)) = 0; A050326(a(n)) = 1. - Reinhard Zumkeller, May 03 2013

A212169 List of highly composite numbers (A002182) with an exponent in its prime factorization that is at least as great as the number of positive exponents; intersection of A002182 and A212165.

Original entry on oeis.org

1, 2, 4, 12, 24, 36, 48, 120, 240, 360, 720, 1680, 5040, 10080, 15120, 20160, 25200, 45360, 50400, 110880, 221760, 332640, 554400, 665280, 2882880, 8648640, 14414400, 17297280, 43243200, 294053760

Offset: 1

Matthew Vandermast, May 22 2012

Sequence can be used to find the largest highly composite number in subsequences of A212165 (of which there are several in the database).
Ramanujan showed that, in the canonical prime factorization of a highly composite number with largest prime factor prime(n), the largest exponent cannot exceed 2*log_2(prime(n+1)). (See formula 54 on page 15 of the Ramanujan paper.) This limit is less than n for all n >= 9 (and prime(n) >= 23).
1. Direct calculation verifies this for 9 <= n <= 11.
2. Nagura proved that, for any integer m >= 25, there is always a prime between m and 1.2*m.  Let n = 11, at which point prime(11) = 31 and log_2(prime(n+1)) = log 37/log 2 = 5.209453.... Since log 1.2/log 2 is only 0.263034..., it follows that n must increase by at least 3k before 2*log_2(prime(n+1)) can increase by 2k, for all values of k. Therefore, 2*log_2(prime(n+1)) can never catch up to prime(n) for n > 11.
665280 = 2^6*3^3*5*7*11 is the largest highly composite number whose prime factorization contains an exponent that is strictly greater than the number of positive exponents in that factorization (including the implied 1's).

			A002182(62) = 294053760 = 2^7*3^3*5*7*11*13*17 has 7 positive exponents in its prime factorization, including 5 implied 1's. The maximal exponent in its prime factorization is also 7. Therefore, 294053760 is a term of this sequence.

S. Ramanujan, Highly composite numbers, Proc. Lond. Math. Soc. 14 (1915), 347-409; reprinted in Collected Papers, Ed. G. H. Hardy et al., Cambridge 1927; Chelsea, NY, 1962.

A. Flammenkamp, List of the first 1200 highly composite numbers
J. Nagura, On the interval containing at least one prime number, Proc. Japan Acad., 28 (1952), 177-181.
S. Ramanujan, Highly Composite Numbers (p. 15) (pages 11-12 introduce some of the notation in formula 54)

A212165 also includes all terms in A006939, A066120, A087980, A130091, A138534, A141586, A166475, A181555, A181813-A181814, A181818, A181823-A181825, A182763.

Other finite subsequences of A002182 include A072938, A095921, A106037, A136253, A162935, A166981, A168263.

okQ[n_] := Module[{f = Transpose[FactorInteger[n]][[2]]}, Max[f] >= Length[f]]; a = 0; t = {}; Do[b = DivisorSigma[0, n]; If[b > a, a = b; If[okQ[n], AppendTo[t, n]]], {n, 10^6}]; t (* T. D. Noe, May 24 2012 *)

A346407 a(n) is the position of A051451(n) in A025487.

Original entry on oeis.org

1, 2, 4, 6, 13, 29, 36, 55, 112, 223, 264, 514, 956, 1749, 2345, 2847, 5005, 8567, 9507, 16073, 26792, 43730, 70482, 88969, 140871, 221370, 342958, 368588, 565510, 859401, 1290994, 1927925, 2128165, 3142980, 4616207, 6754033, 9810997, 14133201, 20230329, 28744301

Offset: 1

Amiram Eldar, Jul 15 2021

nonn

Equivalently, the positions of the distinct terms of A003418 in A025487.

			A138534(1) = A025487(1) = 1, so a(1) = 1.
A138534(2) = A025487(2) = 2, so a(2) = 2.
A138534(3) = A025487(4) = 6, so a(3) = 4.

Cf. A003418, A051451, A025487.

Similar sequences: A098718, A098719, A293635, A306802, A346043.

lps = Cases[Import["https://oeis.org/A025487/b025487.txt", "Table"], {, }][[;; , 2]]; s = {}; lcms = Union @ Table[LCM @@ Range[n], {n, 1, 31}]; Do[p = Position[lps, lcms[[n]]]; If[p == {}, Break[]]; AppendTo[s, p[[1, 1]]], {n, 1, Length[lcms]}]; s

A025487(a(n)) = A003418(n).

cp's OEIS Frontend

A346043 a(n) is the position of A138534(n) in A025487.

Views

Author

Keywords

Examples

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A346044 Decimal expansion of Sum_{k>=0} 1/A138534(k).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A215366 Triangle T(n,k) read by rows in which n-th row lists in increasing order all partitions lambda of n encoded as Product_{i in lambda} prime(i); n>=0, 1<=k<=A000041(n).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A212166 Numbers k such that the maximum exponent in its prime factorization equals the number of positive exponents (A051903(k) = A001221(k)).

Views

Author

Keywords

Examples

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A212169 List of highly composite numbers (A002182) with an exponent in its prime factorization that is at least as great as the number of positive exponents; intersection of A002182 and A212165.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A346407 a(n) is the position of A051451(n) in A025487.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula