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.

Showing 1-4 of 4 results.

A360557 Numbers > 1 whose sorted first differences of 0-prepended prime indices have non-integer median.

Original entry on oeis.org

4, 10, 15, 22, 24, 25, 33, 34, 36, 40, 46, 51, 54, 55, 56, 62, 69, 77, 82, 85, 88, 93, 94, 100, 104, 115, 118, 119, 121, 123, 134, 135, 136, 141, 146, 152, 155, 161, 166, 177, 184, 187, 194, 196, 201, 205, 206, 217, 218, 219, 220, 221, 225, 232, 235, 240, 248
Offset: 1

Views

Author

Gus Wiseman, Feb 17 2023

Keywords

Comments

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.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).

Examples

			The 0-prepended prime indices of 1617 are {0,2,4,4,5}, with sorted differences {0,1,2,2}, with median 3/2, so 1617 is in the sequence.

Crossrefs

For mean instead of median complement we have A340610, counted by A168659.
For mean instead of median we have A360668, counted by A200727.
Positions of odd terms in A360555.
The complement is A360556 (without 1), counted by A360688.
These partitions are counted by A360691.
- For divisors (A063655) we have A139710, complement A139711.
- For prime indices (A360005) we have A359912, complement A359908.
- For distinct prime indices (A360457) we have A360551, complement A360550.
- For distinct prime factors (A360458) we have A100367, complement A360552.
- For prime factors (A360459) we have A072978, complement A359913.
- For prime multiplicities (A360460) we have A360554, complement A360553.
- For 0-prepended differences (A360555) we have A360557, complement A360556.
A112798 lists prime indices, length A001222, sum A056239.
A287352 lists 0-prepended first differences of prime indices.
A325347 counts partitions with integer median, complement A307683.
A355536 lists first differences of prime indices.
A359893 and A359901 count partitions by median, odd-length A359902.
A360614/A360615 = mean of first differences of 0-prepended prime indices.
Cf. A000975, A026424, A078175, A316413, A360009, A360558, A360669, A360681.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[2,100],!IntegerQ[Median[Differences[Prepend[prix[#],0]]]]&]

A199884 Number of compositions of n such that the number of parts is not divisible by the greatest part.

Original entry on oeis.org

0, 1, 1, 6, 8, 19, 43, 90, 167, 339, 722, 1503, 2987, 5883, 11820, 24167, 49348, 99707, 199626, 398475, 797457, 1604029, 3237867, 6534327, 13143278, 26336266, 52664325, 105349525, 211135006, 423949168, 851981311, 1711365899, 3433202397, 6878160656, 13768314357
Offset: 1

Views

Author

Alois P. Heinz, Nov 11 2011

Keywords

Examples

			a(5) = 8: [1,2,2], [1,4], [2,1,2], [2,2,1], [2,3], [3,2], [4,1], [5].

Links

Crossrefs

Cf. A000079, A171634, A200727.

Programs

  • Maple
    b:= proc(n, t, g) option remember; `if`(n=0, `if`(irem(t, g)=0, 0, 1), add(b(n-i, t+1, max(i, g)), i=1..n)) end: a:= n-> b(n, 0, 0): seq(a(n), n=1..40);
  • Mathematica
    b[n_, t_, g_] := b[n, t, g] = If[n == 0, If[Mod[t, g] == 0, 0, 1], Sum [b[n-i, t+1, Max[i, g]], {i, 1, n}]]; a[n_] := b[n, 0, 0]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Nov 05 2014, after Alois P. Heinz *)

Formula

G.f.: Sum_{n>0} (2^(n-1)*x^n -Sum_{d|n} ((x^(d+1)-x)^n-(x^d-x)^n)/(x-1)^n).
a(n) = A000079(n-1) - A171634(n).

A199885 Number of compositions of n such that the greatest part is not divisible by the number of parts.

Original entry on oeis.org

0, 1, 1, 6, 10, 23, 49, 106, 215, 444, 906, 1849, 3759, 7621, 15402, 31091, 62676, 126206, 253860, 510204, 1024665, 2056608, 4125625, 8272436, 16580967, 33223336, 66550937, 133278720, 266857006, 534220745, 1069297319, 2140037990, 4282507048, 8569103770
Offset: 1

Views

Author

Alois P. Heinz, Nov 11 2011

Keywords

Examples

			a(4) = 6: [1,1,1,1], [1,1,2], [1,2,1], [1,3], [2,1,1], [3,1].

Links

Crossrefs

Cf. A000079, A171632, A200727.

Programs

  • Maple
    b:= proc(n, t, g) option remember; `if`(n=0, `if`(irem(g, t)=0, 0, 1), add(b(n-i, t+1, max(i, g)), i=1..n)) end: a:= n-> b(n, 0, 0): seq(a(n), n=1..40);
  • Mathematica
    b[n_, t_, g_] := b[n, t, g] = If[n == 0, If[Mod[g, t] == 0, 0, 1], Sum [b[n-i, t+1, Max[i, g]], {i, 1, n}]]; a[n_] := b[n, 0, 0]; Table[a[n], {n, 1, 40}] (* Jean-François Alcover, Nov 05 2014, after Alois P. Heinz *)

Formula

G.f.: Sum_{n>0} (2^(n-1)*x^n-Sum_{d|n} ((x^(n+1)-x)^d-(x^n-x)^d)/(x-1)^d).
a(n) = A000079(n-1) - A171632(n).

A360668 Numbers > 1 whose greatest prime index is not divisible by their number of prime factors (bigomega).

Original entry on oeis.org

4, 8, 10, 12, 15, 16, 18, 22, 24, 25, 27, 28, 32, 33, 34, 36, 40, 42, 44, 46, 48, 51, 54, 55, 60, 62, 63, 64, 66, 68, 69, 70, 72, 76, 77, 80, 81, 82, 85, 88, 90, 93, 94, 96, 98, 99, 100, 102, 104, 105, 108, 110, 112, 114, 115, 116, 118, 119, 120, 121, 123, 124
Offset: 1

Views

Author

Gus Wiseman, Feb 17 2023

Keywords

Comments

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 numbers > 1 whose first differences of 0-prepended prime indices have non-integer mean.

Examples

			The prime indices of 1617 are {2,4,4,5}, and 5 is not divisible by 4, so 1617 is in the sequence.

Crossrefs

These partitions are counted by A200727.
The complement is A340610 (without 1), counted by A168659.
For median instead of mean we have A360557, counted by A360691.
Positions of terms > 1 in A360615 (numerator: A360614).
A058398 counts partitions by mean, see also A008284, A327482.
A067340 lists numbers whose prime signature has integer mean.
A112798 = prime indices, length A001222, sum A056239, mean A326567/A326568.
A334201 adds up all prime indices except the greatest.
A348551 = numbers w/ non-integer mean of prime indices, complement A316413.
Cf. A072978, A078175, A139710, A307683, A359912, A360551, A360554, A360556, A360669.

Programs

  • Mathematica
    Select[Range[2,100],!Divisible[PrimePi[FactorInteger[#][[-1,1]]],PrimeOmega[#]]&]
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.