A067824 -id:A067824 - cp's OEIS frontend

A038046 Shifts left under transform T where Ta is (identity) DCONV a.

1, 1, 3, 6, 12, 17, 32, 39, 63, 81, 120, 131, 213, 226, 311, 377, 503, 520, 742, 761, 1031, 1169, 1442, 1465, 2008, 2093, 2558, 2801, 3465, 3494, 4591, 4622, 5628, 6054, 7111, 7390, 9321, 9358, 10899, 11616, 13873, 13914, 17070, 17113, 20063, 21509, 24462

Offset: 1

Christian G. Bower

Eigensequence of triangle A126988. (i.e. the sequence shifts upon multiplication from the left by triangle A126988). - Gary W. Adamson, Apr 27 2009

Number of planted achiral trees with a distinguished leaf. - Gus Wiseman, Jul 31 2018

			From _Gus Wiseman_, Jul 31 2018: (Start)
The a(5) = 12 planted achiral trees with a distinguished leaf:
  (Oooo), (oOoo), (ooOo), (oooO),
  ((O)(o)), ((o)(O)),
  ((Ooo)), ((oOo)), ((ooO)),
  (((Oo))), (((oO))),
  ((((O)))).
(End)

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Cf. A126988. - Gary W. Adamson, Apr 27 2009

Cf. A000081, A002033, A003238, A004111, A007554, A038046, A067824, A317580.

a:= proc(n) option remember; `if`(n<2, n, (m-> m*
      add(a(d)/d, d=numtheory[divisors](m)))(n-1))
    end:
seq(a(n), n=1..50);  # Alois P. Heinz, May 09 2019

a[n_]:=If[n==1,1,Sum[d*a[(n-1)/d],{d,Divisors[n-1]}]];
Array[a,30] (* Gus Wiseman, Jul 31 2018 *)

a(1) = 1; a(n > 1) = Sum_{d|(n-1)} d * a((n-1)/d). - Gus Wiseman, Jul 31 2018

G.f. A(x) satisfies: A(x) = x * (1 + Sum_{j>=1} j*A(x^j)). - Ilya Gutkovskiy, May 09 2019

A330575 a(n) = n + Sum_{d|n and d1; a(1) = 1.

Original entry on oeis.org

1, 3, 4, 8, 6, 14, 8, 20, 14, 20, 12, 42, 14, 26, 26, 48, 18, 54, 20, 58, 34, 38, 24, 116, 32, 44, 46, 74, 30, 104, 32, 112, 50, 56, 50, 176, 38, 62, 58, 156, 42, 132, 44, 106, 96, 74, 48, 304, 58, 112, 74, 122, 54, 190, 74, 196, 82, 92, 60, 346, 62, 98, 124, 256, 86

Offset: 1

Michel Marcus, Dec 18 2019

nonn

			a(2) = 2 + a(1) = 2 + 1 = 3, since the only proper divisors of 2 is 1.
a(4) = 4 + a(1) + a(2) = 4 + 1 + 3 = 8, since the proper divisors of 4 are 1 and 2.
a(6) = 6 + a(1) + a(2) + a(3) = 6 + 1 + 3 + 4 = 14, since the proper divisors of 6 are 1, 2 and 3.

Robert Israel, Table of n, a(n) for n = 1..10000
Thomas Fink, Recursively divisible numbers, arXiv:1912.07979 [math.NT], 2019. See Table 2 p. 11.
Thomas Fink, Recursively abundant and recursively perfect numbers, arXiv:2008.10398 [math.NT], 2020.
T. M. A. Fink, Properties of the recursive divisor function and the number of ordered factorizations, arXiv:2307.09140 [math.NT], 2023.

Cf. A067824, A074206, A191161, A255242, A378217 (Dirichlet inverse).

a:=[1]; for n in [2..65] do Append(~a,(n+&+[a[d]:d in Set(Divisors(n)) diff {n}])); end for; a; // Marius A. Burtea, Dec 18 2019

f:= proc(n) option remember;
n + add(procname(d), d = numtheory:-divisors(n) minus {n})
end proc:
map(f, [$1..100]); # Robert Israel, Dec 19 2019

a[1] = 1; a[n_] := a[n] = n + DivisorSum[n, a[#] &, # < n &]; Array[a, 65] (* Amiram Eldar, Apr 12 2020 *)

a(n) = if (n==1, 1, n + sumdiv(n, d, if (d

a(p) = p+1 for p prime.
a(n) = n + A255242(n). - Rémy Sigrist, Dec 18 2019
G.f. A(x) satisfies: A(x) = x/(1 - x)^2 + Sum_{k>=2} A(x^k). - Ilya Gutkovskiy, Dec 18 2019
a(n) = Sum_{d|n} A074206(d) * n/d. - David A. Corneth, Apr 13 2020

A343338 Numbers with no prime index dividing or divisible by all the other prime indices.

Original entry on oeis.org

1, 15, 33, 35, 45, 51, 55, 69, 75, 77, 85, 91, 93, 95, 99, 105, 119, 123, 135, 141, 143, 145, 153, 155, 161, 165, 175, 177, 187, 201, 203, 205, 207, 209, 215, 217, 219, 221, 225, 231, 245, 247, 249, 253, 255, 265, 275, 279, 285, 287, 291, 295, 297, 299, 301

Offset: 1

Gus Wiseman, Apr 13 2021

nonn

Alternative name: 1 and numbers whose smallest prime index does not divide all the other prime indices, nor whose greatest prime index is divisible by all the other prime indices.
First differs from A302697 in having 91.
First differs from A337987 in having 91.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
Also Heinz numbers of partitions with greatest part not divisible by all the others and smallest part not dividing all the others (counted by A343342). The Heinz number of a partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), giving a bijective correspondence between positive integers and integer partitions.

			The sequence of terms together with their prime indices begins:
      1: {}         105: {2,3,4}      203: {4,10}
     15: {2,3}      119: {4,7}        205: {3,13}
     33: {2,5}      123: {2,13}       207: {2,2,9}
     35: {3,4}      135: {2,2,2,3}    209: {5,8}
     45: {2,2,3}    141: {2,15}       215: {3,14}
     51: {2,7}      143: {5,6}        217: {4,11}
     55: {3,5}      145: {3,10}       219: {2,21}
     69: {2,9}      153: {2,2,7}      221: {6,7}
     75: {2,3,3}    155: {3,11}       225: {2,2,3,3}
     77: {4,5}      161: {4,9}        231: {2,4,5}
     85: {3,7}      165: {2,3,5}      245: {3,4,4}
     91: {4,6}      175: {3,3,4}      247: {6,8}
     93: {2,11}     177: {2,17}       249: {2,23}
     95: {3,8}      187: {5,7}        253: {5,9}
     99: {2,2,5}    201: {2,19}       255: {2,3,7}
For example, the prime indices of 975 are {2,3,3,6}, all of which divide 6, but not all of which are multiples of 2, so 975 is not in the sequence.

The first condition alone gives A342193.
The second condition alone gives A343337.
The half-opposite versions are A343339 and A343340.
The partitions with these Heinz numbers are counted by A343342.
The opposite version is the complement of A343343.
A000005 counts divisors.
A000070 counts partitions with a selected part.
A001055 counts factorizations.
A056239 adds up prime indices, row sums of A112798.
A067824 counts strict chains of divisors starting with n.
A253249 counts strict chains of divisors.
A339564 counts factorizations with a selected factor.
Cf. A083710, A130689, A338470, A339562, A341450, A343341, A343346, A343347, A343348, A343377, A343379, A343382.

Select[Range[100],#==1||With[{p=PrimePi/@First/@FactorInteger[#]},!And@@IntegerQ/@(Max@@p/p)&&!And@@IntegerQ/@(p/Min@@p)]&]

Intersection of A342193 and A343337.

A337255 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors starting with n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 3, 2, 1, 1, 1, 3, 3, 1, 1, 2, 1, 1, 3, 2, 1, 1, 1, 5, 7, 3, 1, 1, 1, 3, 2, 1, 3, 2, 1, 4, 6, 4, 1, 1, 1, 1, 5, 7, 3, 1, 1, 1, 5, 7, 3, 1, 3, 2, 1, 3, 2, 1, 1, 1, 7, 15, 13, 4, 1, 2, 1, 1, 3, 2, 1, 3, 3, 1, 1, 5, 7, 3, 1, 1, 1

Offset: 1

Gus Wiseman, Aug 23 2020

			Sequence of rows begins:
     1: {1}           16: {1,4,6,4,1}
     2: {1,1}         17: {1,1}
     3: {1,1}         18: {1,5,7,3}
     4: {1,2,1}       19: {1,1}
     5: {1,1}         20: {1,5,7,3}
     6: {1,3,2}       21: {1,3,2}
     7: {1,1}         22: {1,3,2}
     8: {1,3,3,1}     23: {1,1}
     9: {1,2,1}       24: {1,7,15,13,4}
    10: {1,3,2}       25: {1,2,1}
    11: {1,1}         26: {1,3,2}
    12: {1,5,7,3}     27: {1,3,3,1}
    13: {1,1}         28: {1,5,7,3}
    14: {1,3,2}       29: {1,1}
    15: {1,3,2}       30: {1,7,12,6}
Row n = 24 counts the following chains:
  24  24/1   24/2/1   24/4/2/1   24/8/4/2/1
      24/2   24/3/1   24/6/2/1   24/12/4/2/1
      24/3   24/4/1   24/6/3/1   24/12/6/2/1
      24/4   24/4/2   24/8/2/1   24/12/6/3/1
      24/6   24/6/1   24/8/4/1
      24/8   24/6/2   24/8/4/2
      24/12  24/6/3   24/12/2/1
             24/8/1   24/12/3/1
             24/8/2   24/12/4/1
             24/8/4   24/12/4/2
             24/12/1  24/12/6/1
             24/12/2  24/12/6/2
             24/12/3  24/12/6/3
             24/12/4
             24/12/6

Alois P. Heinz, Rows n = 1..5000, flattened

A008480 gives rows ends.
A067824 gives row sums.
A073093 gives row lengths.
A334996 appears to be the case of chains ending with 1.
A337071 is the sum of row n!.
A000005 counts divisors.
A001055 counts factorizations.
A001222 counts prime factors with multiplicity.
A067824 counts chains of divisors starting with n.
A074206 counts chains of divisors from n to 1.
A122651 counts chains of divisors summing to n.
A167865 counts chains of divisors > 1 summing to n.
A251683 counts chains of divisors from n to 1 by length.
A253249 counts nonempty chains of divisors.
A337070 counts chains of divisors starting with A006939(n).
A337256 counts chains of divisors.
Cf. A001221, A002033, A124010, A124433, A337074, A337105, A337107.

b:= proc(n) option remember; expand(x*(1 +
      add(b(d), d=numtheory[divisors](n) minus {n})))
    end:
T:= n-> (p-> seq(coeff(p, x, i), i=1..degree(p)))(b(n)):
seq(T(n), n=1..50);  # Alois P. Heinz, Aug 23 2020

chss[n_]:=Prepend[Join@@Table[Prepend[#,n]&/@chss[d],{d,Most[Divisors[n]]}],{n}];
Table[Length[Select[chss[n],Length[#]==k&]],{n,30},{k,1+PrimeOmega[n]}]

A191161 Hypersigma(n), definition 2: sum of the divisors of n plus the recursive sum of the divisors of the proper divisors.

Original entry on oeis.org

1, 4, 5, 12, 7, 22, 9, 32, 19, 30, 13, 72, 15, 38, 37, 80, 19, 90, 21, 96, 47, 54, 25, 208, 39, 62, 65, 120, 31, 178, 33, 192, 67, 78, 65, 316, 39, 86, 77, 272, 43, 222, 45, 168, 147, 102, 49, 560, 67, 174, 97, 192, 55

Offset: 1

Alonso del Arte, May 26 2011

In wanting to ensure the definition was not arbitrary, I initially thought that 1s had to stop the recursion. But as T. D. Noe showed me, this doesn't have to be the case: the 1s can be included in the recursion.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000
Jon Maiga, Computer-generated formulas for A191161, Sequence Machine.

Cf. A000203, A191150, A202687, A255242, A378211 (Dirichlet inverse).

Sequences that appear in the convolution formulas: A000010, A000203, A007429, A038040, A060640, A067824, A074206, A174725, A253249, A323910, A323912, A330575.

hsTD[n_] := hsTD[n] = Module[{d = Divisors[n]}, Total[d] + Total[hsTD /@ Most[d]]]; Table[hsTD[n], {n, 100}] (* From T. D. Noe *)

a(n)=sumdiv(n,d,if(dCharles R Greathouse IV, Dec 20 2011

a(n) = sigma(n) + sum_{d | n, d < n} a(d). - Charles R Greathouse IV, Dec 20 2011
From Antti Karttunen, Nov 22 2024: (Start)
Following formulas were conjectured by Sequence Machine:
For n > 1, a(n) = A191150(n) + A074206(n).
a(n) = A330575(n) + A255242(n) = 2*A255242(n) + n = 2*A330575(n) - n.
a(n) = Sum_{d|n} A330575(d).
a(n) = Sum_{d|n} d*A067824(n/d).
a(n) = Sum_{d|n} A000203(d)*A074206(n/d).
a(n) = Sum_{d|n} A007429(d)*A174725(n/d).
a(n) = Sum_{d|n} A000010(d)*A253249(n/d).
a(n) = Sum_{d|n} A038040(d)*A323912(n/d).
a(n) = Sum_{d|n} A060640(d)*A323910(n/d).
(End)

A336941 Number of strict chains of divisors starting with the superprimorial A006939(n) and ending with 1.

Original entry on oeis.org

1, 1, 8, 604, 691968, 16359233536, 10083474928244288, 195661337707783118840768, 139988400203593571474134024847360, 4231553868972506381329450624389969130848256, 6090860257621637852755610879241895108657182173073604608, 464479854191019594417264488167571483344961210693790188774166838214656

Offset: 0

Gus Wiseman, Aug 13 2020

nonn

			The a(2) = 8 chains:
  12/1
  12/2/1
  12/3/1
  12/4/1
  12/6/1
  12/4/2/1
  12/6/2/1
  12/6/3/1

Andrew Howroyd, Table of n, a(n) for n = 0..25

A022915 is the maximal case.
A076954 can be used instead of A006939.
A336571 is the case with distinct prime multiplicities.
A336942 is the case using members of A130091.
A337070 is the version ending with any divisor of A006939(n).
A000005 counts divisors.
A074206 counts chains of divisors from n to 1.
A006939 lists superprimorials or Chernoff numbers.
A067824 counts divisor chains starting with n.
A181818 gives products of superprimorials, with complement A336426.
A253249 counts chains of divisors.
A317829 counts factorizations of superprimorials.
A336423 counts chains using A130091, with maximal case A336569.
Cf. A000142, A001055, A002033, A008480, A022559, A027423, A124010, A167865, A181796, A336417, A336420, A337069.

chern[n_]:=Product[Prime[i]^(n-i+1),{i,n}];
chns[n_]:=If[n==1,1,Sum[chns[d],{d,Most[Divisors[n]]}]];
Table[chns[chern[n]],{n,0,3}]

a(n)={my(sig=vector(n,i,i), m=vecsum(sig)); sum(k=0, m, prod(i=1, #sig, binomial(sig[i]+k-1, k-1))*sum(r=k, m, binomial(r,k)*(-1)^(r-k)))} \\ Andrew Howroyd, Aug 30 2020

a(n) = A337070(n)/2 for n > 0.

a(n) = A074206(A006939(n)).

Terms a(8) and beyond from Andrew Howroyd, Aug 30 2020

A342515 Number of strict partitions of n with constant (equal) first-quotients.

Original entry on oeis.org

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

Offset: 0

Gus Wiseman, Mar 19 2021

nonn

Also the number of reversed strict partitions of n with constant (equal) first-quotients.

The first quotients of a sequence are defined as if the sequence were an increasing divisor chain, so for example the quotients of (6,3,1) are (1/2,1/3).

			The a(1) = 1 through a(15) = 9 partitions (A..F = 10..15):
  1   2   3    4    5    6    7     8    9    A    B    C    D     E     F
          21   31   32   42   43    53   54   64   65   75   76    86    87
                    41   51   52    62   63   73   74   84   85    95    96
                              61    71   72   82   83   93   94    A4    A5
                              421        81   91   92   A2   A3    B3    B4
                                                   A1   B1   B2    C2    C3
                                                             C1    D1    D2
                                                             931   842   E1
                                                                         8421

Wikipedia, Arithmetic progression
Gus Wiseman, Sequences counting and ranking integer partitions by the differences of their successive parts.
Gus Wiseman, Sequences counting and ranking partitions and compositions by their differences and quotients.

The version for differences instead of quotients is A049980.
The non-strict ordered version is A342495.
The non-strict version is A342496.
The distinct instead of equal version is A342520.
A000005 counts constant partitions.
A000041 counts partitions (strict: A000009).
A001055 counts factorizations (strict: A045778, ordered: A074206).
A003238 counts chains of divisors summing to n - 1 (strict: A122651).
A154402 counts partitions with adjacent parts x = 2y.
A167865 counts strict chains of divisors > 1 summing to n.
A175342 counts compositions with equal differences.
Cf. A003242, A005117, A049988, A057567, A067824, A253249, A307824, A318991, A318992, A325328, A342086.

Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&SameQ@@Divide@@@Partition[#,2,1]&]],{n,0,30}]

A066637 Total number of elements in all factorizations of n with all factors > 1.

Original entry on oeis.org

0, 1, 1, 3, 1, 3, 1, 6, 3, 3, 1, 8, 1, 3, 3, 12, 1, 8, 1, 8, 3, 3, 1, 17, 3, 3, 6, 8, 1, 10, 1, 20, 3, 3, 3, 22, 1, 3, 3, 17, 1, 10, 1, 8, 8, 3, 1, 34, 3, 8, 3, 8, 1, 17, 3, 17, 3, 3, 1, 27, 1, 3, 8, 35, 3, 10, 1, 8, 3, 10, 1, 46, 1, 3, 8, 8, 3, 10, 1, 34, 12, 3, 1, 27, 3, 3, 3, 17, 1, 27, 3, 8, 3, 3, 3

Offset: 1

Amarnath Murthy, Dec 28 2001

nonn

From Gus Wiseman, Apr 18 2021: (Start)
Number of ways to choose a factor index or position in a factorization of n. The version selecting a factor value is A339564. For example, the factorizations of n = 2, 4, 8, 12, 16, 24, 30 with a selected position (in parentheses) are:
  ((2))  ((4))    ((8))      ((12))     ((16))       ((24))       ((30))
         ((2)*2)  ((2)*4)    ((2)*6)    ((2)*8)      ((3)*8)      ((5)*6)
         (2*(2))  (2*(4))    (2*(6))    (2*(8))      (3*(8))      (5*(6))
                  ((2)*2*2)  ((3)*4)    ((4)*4)      ((4)*6)      ((2)*15)
                  (2*(2)*2)  (3*(4))    (4*(4))      (4*(6))      (2*(15))
                  (2*2*(2))  ((2)*2*3)  ((2)*2*4)    ((2)*12)     ((3)*10)
                             (2*(2)*3)  (2*(2)*4)    (2*(12))     (3*(10))
                             (2*2*(3))  (2*2*(4))    ((2)*2*6)    ((2)*3*5)
                                        ((2)*2*2*2)  (2*(2)*6)    (2*(3)*5)
                                        (2*(2)*2*2)  (2*2*(6))    (2*3*(5))
                                        (2*2*(2)*2)  ((2)*3*4)
                                        (2*2*2*(2))  (2*(3)*4)
                                                     (2*3*(4))
                                                     ((2)*2*2*3)
                                                     (2*(2)*2*3)
                                                     (2*2*(2)*3)
                                                     (2*2*2*(3))
(End)

			a(12) = 8: there are 4 factorizations of 12: (12), (6*2), (4*3), (3*2*2) having 1, 2, 2, 3 elements respectively, a total of 8.

Amarnath Murthy, Generalization of Partition function, Introducing Smarandache Factor partitions, Smarandache Notions Journal, Vol. 11, 1-2-3, Spring 2000.
Amarnath Murthy, Length and extent of Smarandache Factor partitions, Smarandache Notions Journal, Vol. 11, 1-2-3, Spring 2000.

Alois P. Heinz, Table of n, a(n) for n = 1..20000 (first 1000 terms from T. D. Noe)

The version for normal multisets is A001787.
The version for compositions is A001792.
The version for partitions is A006128 (strict: A015723).
Choosing a value instead of position gives A339564.
A000070 counts partitions with a selected part.
A001055 counts factorizations.
A002033 and A074206 count ordered factorizations.
A067824 counts strict chains of divisors starting with n.
A336875 counts compositions with a selected part.
Cf. A000005, A000041, A045778, A050336, A066186, A162247, A264401, A281116, A292504, A292886, A322794.

# Return a list of lists which are factorizations (product representations)
# of n. Within each sublist, the factors are sorted. A minimum factor in
# each element of sublists returned can be specified with 'mincomp'.
# If mincomp=2, the number of sublists contained in the list returned is A001055(n).
# Example:
# n=8 and mincomp=2 return [[2,2,2],[4,8],[8]]
listProdRep := proc(n,mincomp)
    local dvs,resul,f,i,j,rli,tmp ;
    resul := [] ;
    # list returned is empty if n < mincomp
    if n >= mincomp then
        if n = 1 then
            RETURN([1]) ;
        else
            # compute the divisors, and take each divisor
            # as a head element (minimum element) of one of the
            # sublists. Example: for n=8 use {1,2,4,8}, and consider
            # (for mincomp=2) sublists [2,...], [4,...] and [8].
            dvs := numtheory[divisors](n) ;
            for i from 1 to nops(dvs) do
                # select the head element 'f' from the divisors
                f := op(i,dvs) ;
                # if this is already the maximum divisor n
                # itself, this head element is the last in
                # the sublist
                if f =n and f >= mincomp then
                    resul := [op(resul),[f]] ;
                elif f >= mincomp then
                    # if this is not the maximum element
                    # n itself, produce all factorizations
                    # of the remaining factor recursively.
                    rli := procname(n/f,f) ;
                    # Prepend all the results produced
                    # from the recursion with the head
                    # element for the result.
                    for j from 1 to nops(rli) do
                        tmp := [f,op(op(j,rli))] ;
                        resul := [op(resul),tmp] ;
                    od ;
                fi ;
            od ;
        fi ;
    fi ;
    resul ;
end:
A066637 := proc(n)
    local f,d;
    a := 0 ;
    for d in listProdRep(n,2) do
        a := a+nops(d) ;
    end do:
    a ;
end proc: # R. J. Mathar, Jul 11 2013
# second Maple program:
with(numtheory):
b:= proc(n, k) option remember; `if`(n>k, 0, [1$2])+
      `if`(isprime(n), 0, (p-> p+[0, p[1]])(add(
      `if`(d>k, 0, b(n/d, d)), d=divisors(n) minus {1, n})))
    end:
a:= n-> `if`(n<2, 0, b(n$2)[2]):
seq(a(n), n=1..120); # Alois P. Heinz, Feb 12 2019

g[1, r_] := g[1, r]={1, 0}; g[n_, r_] := g[n, r]=Module[{ds, i, val}, ds=Select[Divisors[n], 1<#<=r&]; val={0, 0}+Sum[g[n/ds[[i]], ds[[i]]], {i, 1, Length[ds]}]; val+{0, val[[1]]}]; a[n_] := g[n, n][[2]]; a/@Range[95] (* g[n, r] = {c, f}, where c is the number of factorizations of n with factors <= r and f is the total number of factors in them. - Dean Hickerson, Oct 28 2002 *)
facs[n_]:=If[n<=1,{{}},Join@@Table[Map[Prepend[#,d]&,Select[facs[n/d],Min@@#>=d&]],{d,Rest[Divisors[n]]}]];Table[Sum[Length[fac],{fac,facs[n]}],{n,50}] (* Gus Wiseman, Apr 18 2021 *)

A317880 Number of series-reduced free pure symmetric identity multifunctions (with empty expressions allowed) with one atom and n positions.

Original entry on oeis.org

1, 1, 1, 1, 2, 4, 8, 16, 33, 70, 152, 333, 735, 1635, 3668, 8285, 18823, 42970, 98535, 226870, 524290, 1215641, 2827203, 6593432, 15416197, 36129894, 84860282, 199719932, 470930802, 1112388190, 2631903295, 6236669381, 14800078408, 35169529363, 83680908692

Offset: 1

Gus Wiseman, Aug 09 2018

nonn

A series-reduced free pure symmetric identity multifunction (with empty expressions allowed) (SROI) is either (case 1) the leaf symbol "o", or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where h is an SROI, k is an integer greater than or equal to 0 but not equal to 1, each of the g_i for i = 1, ..., k is an SROI, and for i < j we have g_i < g_j under a canonical total ordering such as the Mathematica ordering of expressions. The number of positions in an SROI is the number of brackets [...] plus the number of o's.

Also the number of series-reduced orderless identity Mathematica expressions with one atom and n positions.

			The a(7) = 8 SROIs:
  o[o,o[][][]]
  o[o[],o[][]]
  o[][o,o[][]]
  o[][][o,o[]]
  o[o,o[][]][]
  o[][o,o[]][]
  o[o,o[]][][]
  o[][][][][][]

Andrew Howroyd, Table of n, a(n) for n = 1..200

Cf. A001003, A001678, A052893, A053492, A067824, A167865, A277996, A280000, A317875.

Cf. A317876, A317877, A317878, A317879, A317880, A317881.

allIdExprSR[n_]:=If[n==1,{"o"},Join@@Cases[Table[PR[k,n-k-1],{k,n-1}],PR[h_,g_]:>Join@@Table[Apply@@@Tuples[{allIdExprSR[h],Select[Union[Sort/@Tuples[allIdExprSR/@p]],UnsameQ@@#&]}],{p,If[g==0,{{}},Rest[IntegerPartitions[g]]]}]]];
Table[Length[allIdExprSR[n]],{n,12}]

WeighT(v)={Vec(exp(x*Ser(dirmul(v, vector(#v,n,(-1)^(n-1)/n))))-1,-#v)}
seq(n)={my(v=[1]); for(n=2, n, my(t=WeighT(v)-v); v=concat(v, v[n-1] + sum(k=1, n-2, v[k]*t[n-k-1]))); v} \\ Andrew Howroyd, Aug 19 2018

Terms a(13) and beyond from Andrew Howroyd, Aug 19 2018

A317881 Number of series-reduced free pure identity multifunctions (with empty expressions allowed) with one atom and n positions.

Original entry on oeis.org

1, 1, 1, 1, 3, 7, 15, 37, 91, 231, 593, 1557, 4111, 10941, 29295, 79087, 215015, 587463, 1611985, 4441473, 12284513, 34095797, 94931525, 265061363, 742029431, 2082310665, 5856540305, 16505796865, 46608877763, 131850193107, 373612733107, 1060339387939, 3013758348317

Offset: 1

Gus Wiseman, Aug 09 2018

nonn

A series-reduced series-reduced free pure identity multifunction (with empty expressions allowed) (SRIM) is either (case 1) the leaf symbol "o", or (case 2) a possibly empty expression of the form h[g_1, ..., g_k] where h is an SRIM, k is an integer greater than or equal to 0 but not equal to 1, each of the g_i for i = 1, ..., k >= 0 is an SRIM, and for i != j we have g_i != g_j. The number of positions in an SRIM is the number of brackets [...] plus the number of o's.

Also the number of series-reduced identity Mathematica expressions with one atom and n positions.

			The a(6) = 7 SRIMs:
  o[o[][],o]
  o[o,o[][]]
  o[][o[],o]
  o[][o,o[]]
  o[o[],o][]
  o[o,o[]][]
  o[][][][][]

Andrew Howroyd, Table of n, a(n) for n = 1..200

Cf. A001003, A001678, A067824, A167865, A277996, A280000, A317875.

Cf. A317876, A317877, A317878, A317879, A317880.

allIdExprSR[n_]:=If[n==1,{"o"},Join@@Cases[Table[PR[k,n-k-1],{k,n-1}],PR[h_,g_]:>Join@@Table[Apply@@@Tuples[{allIdExprSR[h],Select[Tuples[allIdExprSR/@p],UnsameQ@@#&]}],{p,If[g==0,{{}},Join@@Permutations/@Rest[IntegerPartitions[g]]]}]]];
Table[Length[allIdExprSR[n]],{n,12}]

seq(n)={my(v=vector(n)); v[1]=1; for(n=2, n, my(p=prod(k=1, n, 1 + sum(i=1, n\k, binomial(v[k], i)*x^(i*k)*y^i) + O(x*x^n))); v[n]=v[n-1]+sum(k=1, n-2, v[n-k-1]*(subst(serlaplace(y^0*polcoef(p, k)), y, 1)-v[k]))); v} \\ Andrew Howroyd, Sep 01 2018

Terms a(13) and beyond from Andrew Howroyd, Sep 01 2018

cp's OEIS Frontend

A038046 Shifts left under transform T where Ta is (identity) DCONV a.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A330575 a(n) = n + Sum_{d|n and d1; a(1) = 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A343338 Numbers with no prime index dividing or divisible by all the other prime indices.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A337255 Irregular triangle read by rows where T(n,k) is the number of strict length-k chains of divisors starting with n.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

A191161 Hypersigma(n), definition 2: sum of the divisors of n plus the recursive sum of the divisors of the proper divisors.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A336941 Number of strict chains of divisors starting with the superprimorial A006939(n) and ending with 1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A342515 Number of strict partitions of n with constant (equal) first-quotients.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A066637 Total number of elements in all factorizations of n with all factors > 1.