cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 11-12 of 12 results.

A325800 Numbers whose sum of prime indices is equal to the number of distinct subset-sums of their prime indices.

Original entry on oeis.org

3, 10, 28, 66, 88, 156, 208, 306, 340, 408, 544, 570, 684, 760, 912, 966, 1216, 1242, 1288, 1380, 1656, 1840, 2208, 2436, 2610, 2900, 2944, 3132, 3248, 3480, 3906, 4092, 4176, 4340, 4640, 4650, 5022, 5208, 5456, 5568, 5580, 6200, 6696, 6944, 7326, 7424, 7440
Offset: 1

Views

Author

Gus Wiseman, May 23 2019

Keywords

Comments

First differs from A325793 in lacking 70.
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, with sum A056239(n). A subset-sum of an integer partition is any sum of a submultiset of it.
The Heinz number of an integer partition (y_1,...,y_k) is prime(y_1)*...*prime(y_k), so these are Heinz numbers of integer partitions whose sum is equal to their number of distinct subset-sums. The enumeration of these partitions by sum is given by A126796 interlaced with zeros.

Examples

			340 has prime indices {1,1,3,7} which sum to 12 and have 12 distinct subset-sums: {0, 1, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12}, so 340 is in the sequence.
The sequence of terms together with their prime indices begins:
     3: {2}
    10: {1,3}
    28: {1,1,4}
    66: {1,2,5}
    88: {1,1,1,5}
   156: {1,1,2,6}
   208: {1,1,1,1,6}
   306: {1,2,2,7}
   340: {1,1,3,7}
   408: {1,1,1,2,7}
   544: {1,1,1,1,1,7}
   570: {1,2,3,8}
   684: {1,1,2,2,8}
   760: {1,1,1,3,8}
   912: {1,1,1,1,2,8}
   966: {1,2,4,9}
  1216: {1,1,1,1,1,1,8}
  1242: {1,2,2,2,9}
  1288: {1,1,1,4,9}
  1380: {1,1,2,3,9}
		

Crossrefs

Positions of 1's in A325799.
Includes A239885 except for 1.

Programs

  • Maple
    filter:= proc(n) local F,t,S,i,r;
      F:= map(t -> [numtheory:-pi(t[1]),t[2]], ifactors(n)[2]);
      S:= {0}:
      for t in F do
       S:= map(s -> seq(s + i*t[1],i=0..t[2]),S);
      od;
      nops(S) = add(t[1]*t[2],t=F)
    end proc:
    select(filter, [$1..10000]); # Robert Israel, Oct 30 2024
  • Mathematica
    hwt[n_]:=Total[Cases[FactorInteger[n],{p_,k_}:>PrimePi[p]*k]];
    Select[Range[1000],hwt[#]==Length[Union[hwt/@Divisors[#]]]&]

Formula

A056239(a(n)) = A299701(a(n)) = A304793(a(n)) + 1.

A325987 Irregular triangle read by rows where T(n,k) is the number of integer partitions of n with k submultisets, k > 0.

Original entry on oeis.org

1, 0, 1, 0, 1, 1, 0, 1, 0, 2, 0, 1, 1, 1, 1, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 1, 1, 3, 0, 1, 1, 2, 1, 1, 0, 1, 0, 3, 0, 3, 0, 4, 0, 1, 0, 3, 0, 1, 1, 3, 1, 3, 0, 3, 2, 1, 0, 4, 0, 1, 1, 1, 0, 1, 0, 5, 0, 3, 0, 5, 0, 3, 0, 6, 0, 1, 0, 3, 0, 2, 0, 1, 0, 1, 1, 4, 0
Offset: 0

Views

Author

Gus Wiseman, May 30 2019

Keywords

Comments

The number of submultisets of a partition is the product of its multiplicities, each plus one.

Examples

			Triangle begins:
  1
  0 1
  0 1 1
  0 1 0 2
  0 1 1 1 1 1
  0 1 0 2 0 3 0 1
  0 1 1 3 0 1 1 2 1 1
  0 1 0 3 0 3 0 4 0 1 0 3
  0 1 1 3 1 3 0 3 2 1 0 4 0 1 1 1
  0 1 0 5 0 3 0 5 0 3 0 6 0 1 0 3 0 2 0 1
  0 1 1 4 0 5 0 7 2 1 1 4 0 1 2 5 0 3 0 2 1 0 0 2
Row n = 7 counts the following partitions (empty columns not shown):
  (7)  (43)  (322)  (421)      (31111)  (3211)
       (52)  (331)  (2221)              (22111)
       (61)  (511)  (4111)              (211111)
                    (1111111)
		

Crossrefs

Row lengths are A088881.
Row sums are A000041.
Diagonal n = k is A325830 interspersed with zeros.
Diagonal n + 1 = k is A325828.
Diagonal n - 1 = k is A325836.
Column k = 3 appears to be A137719.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Times@@(1+Length/@Split[#])==k&]],{n,0,10},{k,1,Max@@(Times@@(1+Length/@Split[#])&)/@IntegerPartitions[n]}]

Formula

Sum_{k=1..A088881(n)} k * T(n,k) = A000712(n). - Alois P. Heinz, Aug 17 2019
Previous Showing 11-12 of 12 results.