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-10 of 26 results. Next

A377033 Array read by antidiagonals downward where A(n,k) is the n-th term of the k-th differences of the composite numbers (A002808).

Original entry on oeis.org

4, 6, 2, 8, 2, 0, 9, 1, -1, -1, 10, 1, 0, 1, 2, 12, 2, 1, 1, 0, -2, 14, 2, 0, -1, -2, -2, 0, 15, 1, -1, -1, 0, 2, 4, 4, 16, 1, 0, 1, 2, 2, 0, -4, -8, 18, 2, 1, 1, 0, -2, -4, -4, 0, 8, 20, 2, 0, -1, -2, -2, 0, 4, 8, 8, 0, 21, 1, -1, -1, 0, 2, 4, 4, 0, -8, -16, -16
Offset: 0

Views

Author

Gus Wiseman, Oct 17 2024

Keywords

Comments

Row n is the k-th differences of A002808 = the composite numbers.

Examples

			Array begins:
        n=1:  n=2:  n=3:  n=4:  n=5:  n=6:  n=7:  n=8:  n=9:
  ----------------------------------------------------------
  k=0:   4     6     8     9    10    12    14    15    16
  k=1:   2     2     1     1     2     2     1     1     2
  k=2:   0    -1     0     1     0    -1     0     1     0
  k=3:  -1     1     1    -1    -1     1     1    -1    -1
  k=4:   2     0    -2     0     2     0    -2     0     2
  k=5:  -2    -2     2     2    -2    -2     2     2    -2
  k=6:   0     4     0    -4     0     4     0    -4    -1
  k=7:   4    -4    -4     4     4    -4    -4     3    10
  k=8:  -8     0     8     0    -8     0     7     7   -29
  k=9:   8     8    -8    -8     8     7     0   -36    63
Triangle begins:
    4
    6    2
    8    2    0
    9    1   -1   -1
   10    1    0    1    2
   12    2    1    1    0   -2
   14    2    0   -1   -2   -2    0
   15    1   -1   -1    0    2    4    4
   16    1    0    1    2    2    0   -4   -8
   18    2    1    1    0   -2   -4   -4    0    8
   20    2    0   -1   -2   -2    0    4    8    8    0
   21    1   -1   -1    0    2    4    4    0   -8  -16  -16
		

Crossrefs

Initial rows: A002808, A073783, A073445.
The version for primes is A095195 or A376682.
A version for partitions is A175804, cf. A053445, A281425, A320590.
Triangle row-sums are A377034, absolute version A377035.
Column n = 1 is A377036, for primes A007442 or A030016.
First position of 0 in each row is A377037.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, seconds A036263.
A008578 lists the noncomposites, differences A075526.
Cf. A065310, A065890, A084758, A173390, A350004, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680.

Programs

  • Mathematica
    nn=9;
    t=Table[Take[Differences[NestList[NestWhile[#+1&, #+1,PrimeQ]&,4,2*nn],k],nn],{k,0,nn}]

Formula

A(i,j) = Sum_{k=0..j} (-1)^(j-k) binomial(j,k) A002808(i+k).

A379315 Number of strict integer partitions of n with a unique 1 or prime part.

Original entry on oeis.org

0, 1, 1, 1, 0, 2, 1, 3, 1, 3, 2, 7, 3, 7, 4, 10, 7, 15, 7, 17, 13, 23, 16, 31, 20, 37, 31, 48, 38, 62, 48, 76, 68, 93, 80, 119, 105, 147, 137, 175, 166, 226, 208, 267, 263, 326, 322, 407, 391, 481, 492, 586, 591, 714, 714, 849, 884, 1020, 1050, 1232, 1263
Offset: 0

Views

Author

Gus Wiseman, Dec 28 2024

Keywords

Comments

The "old" primes are listed by A008578.

Examples

			The a(10) = 2 through a(15) = 10 partitions:
  (8,2)  (11)     (9,3)    (13)     (9,5)    (8,7)
  (9,1)  (6,5)    (10,2)   (7,6)    (12,2)   (10,5)
         (7,4)    (6,4,2)  (8,5)    (8,4,2)  (11,4)
         (8,3)             (10,3)   (9,4,1)  (12,3)
         (9,2)             (12,1)            (14,1)
         (10,1)            (6,4,3)           (6,5,4)
         (6,4,1)           (8,4,1)           (8,4,3)
                                             (8,6,1)
                                             (9,4,2)
                                             (10,4,1)
		

Crossrefs

For all prime parts we have A000586, non-strict A000607 (ranks A076610).
For no prime parts we have A096258, non-strict A002095 (ranks A320628).
For a unique composite part we have A379303, non-strict A379302 (ranks A379301).
Considering 1 nonprime gives A379305, non-strict A379304 (ranks A331915).
For squarefree instead of old prime we have A379309, non-strict A379308 (ranks A379316).
Ranked by A379312 /\ A005117 = squarefree positions of 1 in A379311.
The non-strict version is A379314.
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A376682 gives k-th differences of old primes.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Count[#,_?(#==1||PrimeQ[#]&)]==1&]],{n,0,30}]
  • PARI
    seq(n)={Vec(sum(k=1, n, if(isprime(k) || k==1, x^k)) * prod(k=4, n, 1 + if(!isprime(k), x^k), 1 + O(x^n)), -n-1)} \\ Andrew Howroyd, Dec 28 2024

A379301 Positive integers whose prime indices include a unique composite number.

Original entry on oeis.org

7, 13, 14, 19, 21, 23, 26, 28, 29, 35, 37, 38, 39, 42, 43, 46, 47, 52, 53, 56, 57, 58, 61, 63, 65, 69, 70, 71, 73, 74, 76, 77, 78, 79, 84, 86, 87, 89, 92, 94, 95, 97, 101, 103, 104, 105, 106, 107, 111, 112, 113, 114, 115, 116, 117, 119, 122, 126, 129, 130, 131
Offset: 1

Views

Author

Gus Wiseman, Dec 25 2024

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.

Examples

			The prime indices of 70 are {1,3,4}, so 70 is in the sequence.
The prime indices of 98 are {1,4,4}, so 98 is not in the sequence.
		

Crossrefs

For no composite parts we have A302540, counted by A034891 (strict A036497).
For all composite parts we have A320629, counted by A023895 (strict A204389).
For a unique prime part we have A331915, counted by A379304 (strict A379305).
Positions of one in A379300.
Partitions of this type are counted by A379302 (strict A379303).
A000040 lists the prime numbers, differences A001223.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A066247 is the characteristic function for the composite numbers.
A377033 gives k-th differences of composite numbers, see A073445, A377034-A377037.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
- A379311 old prime, see A379312-A379315.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[100],Length[Select[prix[#],CompositeQ]]==1&]

A379304 Number of integer partitions of n with a unique prime part.

Original entry on oeis.org

0, 0, 1, 2, 2, 3, 4, 6, 7, 9, 11, 17, 20, 26, 31, 41, 47, 62, 72, 93, 108, 136, 156, 199, 226, 279, 321, 398, 452, 555, 630, 767, 873, 1051, 1188, 1433, 1618, 1930, 2185, 2595, 2921, 3458, 3891, 4580, 5155, 6036, 6776, 7926, 8883, 10324, 11577, 13421, 15014
Offset: 0

Views

Author

Gus Wiseman, Dec 27 2024

Keywords

Examples

			The a(2) = 1 through a(9) = 9 partitions:
  (2)  (3)   (31)   (5)     (42)     (7)       (62)       (54)
       (21)  (211)  (311)   (51)     (43)      (71)       (63)
                    (2111)  (3111)   (421)     (431)      (621)
                            (21111)  (511)     (4211)     (711)
                                     (31111)   (5111)     (4311)
                                     (211111)  (311111)   (42111)
                                               (2111111)  (51111)
                                                          (3111111)
                                                          (21111111)
		

Crossrefs

For all prime parts we have A000607 (strict A000586), ranks A076610.
For no prime parts we have A002095 (strict A096258), ranks A320628.
Ranked by A331915 = positions of one in A257994.
For a unique composite part we have A379302 (strict A379303), ranks A379301.
The strict case is A379305.
For squarefree instead of prime we have A379308 (strict A379309), ranks A379316.
Considering 1 prime gives A379314 (strict A379315), ranks A379312.
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A095195 gives k-th differences of prime numbers.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Count[#,_?PrimeQ]==1&]],{n,0,30}]

A379305 Number of strict integer partitions of n with a unique prime part.

Original entry on oeis.org

0, 0, 1, 2, 1, 1, 2, 3, 3, 3, 3, 6, 8, 8, 8, 10, 12, 17, 18, 18, 22, 28, 30, 36, 40, 44, 52, 62, 67, 78, 87, 97, 113, 129, 137, 156, 177, 200, 227, 251, 271, 312, 350, 382, 425, 475, 521, 588, 648, 705, 785, 876, 957, 1061, 1164, 1272, 1411, 1558, 1693, 1866
Offset: 0

Views

Author

Gus Wiseman, Dec 27 2024

Keywords

Examples

			The a(2) = 1 through a(12) = 8 partitions (A=10, B=11):
  (2)  (3)   (31)  (5)  (42)  (7)    (62)   (54)   (82)   (B)    (93)
       (21)             (51)  (43)   (71)   (63)   (541)  (65)   (A2)
                              (421)  (431)  (621)  (631)  (74)   (B1)
                                                          (83)   (642)
                                                          (92)   (651)
                                                          (821)  (741)
                                                                 (831)
                                                                 (921)
		

Crossrefs

For all prime parts we have A000586, non-strict A000607 (ranks A076610).
For no prime parts we have A096258, non-strict A002095 (ranks A320628).
Ranked by A331915 /\ A005117 = squarefree positions of one in A257994.
For a composite instead of prime we have A379303, non-strict A379302 (ranks A379301).
The non-strict version is A379304.
For squarefree instead of prime we have A379309, non-strict A379308 (ranks A379316).
Considering 1 prime gives A379315, non-strict A379314 (ranks A379312).
A000040 lists the prime numbers, differences A001223.
A000041 counts integer partitions, strict A000009.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A095195 gives k-th differences of prime numbers.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],UnsameQ@@#&&Count[#,_?PrimeQ]==1&]],{n,0,30}]

A377034 Antidiagonal-sums of the array A377033(n,k) = n-th term of the k-th differences of the composite numbers (A002808).

Original entry on oeis.org

4, 8, 10, 8, 14, 14, 11, 24, 10, 20, 37, -10, 56, 26, -52, 260, -659, 2393, -8128, 25703, -72318, 184486, -430901, 933125, -1888651, 3597261, -6479654, 11086964, -18096083, 28307672, -42644743, 62031050, -86466235, 110902085, -110907437, 52379, 483682985
Offset: 1

Views

Author

Gus Wiseman, Oct 17 2024

Keywords

Comments

Row-sums of the triangle version of A377033.

Examples

			The fourth antidiagonal of A377033 is (9, 1, -1, -1), so a(4) = 8.
		

Crossrefs

The version for prime instead of composite is A140119, noncomposite A376683.
This is the antidiagonal-sums of the array A377033, absolute version A377035.
For squarefree instead of composite we have A377039, absolute version A377040.
For nonsquarefree instead of composite we have A377047, absolute version A377048.
For prime-power instead of composite we have A377052, absolute version A377053.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, second A036263.
A002808 lists the composite numbers, differences A073783, second A073445.
A008578 lists the noncomposites, differences A075526.
Cf. A018252, A065310, A065890, A333254, A376602 (zero), A376603 (nonzero), A376651 (positive), A376652 (negative), A376680, A377036.

Programs

  • Mathematica
    q=Select[Range[100],CompositeQ];
    t=Table[Sum[(-1)^(j-k)*Binomial[j,k]*q[[i+k]],{k,0,j}],{j,0,Length[q]/2},{i,Length[q]/2}];
    Total/@Table[t[[j,i-j+1]],{i,Length[q]/2},{j,i}]

A377037 Position of first zero in the n-th differences of the composite numbers (A002808), or 0 if it does not appear.

Original entry on oeis.org

1, 14, 2, 65, 1, 83, 2, 7, 1, 83, 2, 424, 12, 32, 11, 733, 10, 940, 9, 1110, 8, 1110, 7, 1110, 6, 1110, 112, 1110, 111, 1110, 110, 2192, 109, 13852, 108, 13852, 107, 13852, 106, 13852, 105, 17384, 104, 17384, 103, 17384, 102, 17384, 101, 27144, 552, 28012, 551
Offset: 2

Views

Author

Gus Wiseman, Oct 17 2024

Keywords

Examples

			The third differences of the composite numbers are:
  -1, 1, 1, -1, -1, 1, 1, -1, -1, 1, 1, -2, 1, 0, 0, 1, -1, -1, ...
so a(3) = 14.
		

Crossrefs

The version for prime instead of composite is A376678.
For noncomposite numbers we have A376855.
This is the first position of 0 in row n of the array A377033.
For squarefree instead of composite we have A377042, nonsquarefree A377050.
For prime-power instead of composite we have A377055.
Other arrays of differences: A095195 (prime), A376682 (noncomposite), A377033 (composite), A377038 (squarefree), A377046 (nonsquarefree), A377051 (prime-power).
A000040 lists the primes, differences A001223, second A036263.
A002808 lists the composite numbers, differences A073783, second A073445.
A008578 lists the noncomposites, differences A075526.
A377036 gives first term of the n-th differences of the composite numbers, for primes A007442 or A030016.

Programs

  • Mathematica
    nn=10000;
    u=Table[Differences[Select[Range[nn],CompositeQ],k],{k,2,16}];
    mnrm[s_]:=If[Min@@s==1,mnrm[DeleteCases[s-1,0]]+1,0];
    m=Table[Position[u[[k]],0][[1,1]],{k,mnrm[Union[First/@Position[u,0]]]}]

Extensions

Offset 2 from Michel Marcus, Oct 18 2024
a(17)-a(54) from Alois P. Heinz, Oct 18 2024

A375740 Numbers k such that A007916(k+1) - A007916(k) = 1. In other words, the k-th non-perfect-power is 1 less than the next.

Original entry on oeis.org

1, 3, 4, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 21, 22, 23, 25, 26, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 70, 71, 72, 73, 74, 75, 76, 77
Offset: 1

Views

Author

Gus Wiseman, Sep 10 2024

Keywords

Comments

Positions in A007916 of numbers k such that k+1 is also a member.
Positions of 1's in A375706 (first differences of A007916).
Non-perfect-powers (A007916) are numbers with no proper integer roots.

Examples

			The non-perfect-powers are 2, 3, 5, 6, 7, 10, 11, 12, 13, ... which increase by one after positions 1, 3, 4, 6, ...
		

Crossrefs

The version for non-prime-powers is A375713, differences A373672.
The complement is A375714, differences A375702.
The version for prime-powers is A375734, differences A373671.
The complement for non-prime-powers is A375928, differences A110969.
A000040 lists the prime numbers, differences A001223.
A000961 lists prime-powers (inclusive), differences A057820.
A001597 lists perfect-powers, differences A053289.
A002808 lists the composite numbers, differences A073783.
A018252 lists the nonprime numbers, differences A065310.
Non-perfect-powers:
- terms: A007916
- differences: A375706
- anti-runs: A375737, A375738, A375739, A375736.
Non-prime-powers (exclusive):
- terms: A361102
- differences: A375708
- anti-runs: A373679, A373575, A255346, A373672

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Join@@Position[Differences[Select[Range[100],radQ]],1]
  • Python
    from itertools import count, islice
    from sympy import perfect_power
    def A375740_gen(): # generator of terms
        a, b = -1, 0
        for n in count(2):
            c = not perfect_power(n)
            if c:
                a += 1
            if b&c:
                yield a
        b = c
    A375740_list = list(islice(A375740_gen(), 52)) # Chai Wah Wu, Sep 11 2024

A379312 Positive integers whose prime indices include a unique 1 or prime number.

Original entry on oeis.org

2, 3, 5, 11, 14, 17, 21, 26, 31, 35, 38, 39, 41, 46, 57, 58, 59, 65, 67, 69, 74, 77, 83, 86, 87, 94, 95, 98, 106, 109, 111, 115, 119, 122, 127, 129, 141, 142, 143, 145, 146, 147, 157, 158, 159, 178, 179, 182, 183, 185, 191, 194, 202, 206, 209, 211, 213, 214
Offset: 1

Views

Author

Gus Wiseman, Dec 28 2024

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.

Examples

			The terms together with their prime indices begin:
    2: {1}
    3: {2}
    5: {3}
   11: {5}
   14: {1,4}
   17: {7}
   21: {2,4}
   26: {1,6}
   31: {11}
   35: {3,4}
   38: {1,8}
   39: {2,6}
   41: {13}
   46: {1,9}
   57: {2,8}
   58: {1,10}
   59: {17}
   65: {3,6}
   67: {19}
   69: {2,9}
   74: {1,12}
   77: {4,5}
		

Crossrefs

These "old" primes are listed by A008578.
For no composite parts we have A302540, counted by A034891 (strict A036497).
For all composite parts we have A320629, counted by A023895 (strict A204389).
For a unique prime part we have A331915, counted by A379304 (strict A379305).
Positions of ones in A379311, see A379313.
Partitions of this type are counted by A379314, strict A379315.
A000040 lists the prime numbers, differences A001223.
A002808 lists the composite numbers, nonprimes A018252, differences A073783 or A065310.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A080339 is the characteristic function for the old prime numbers.
A376682 gives k-th differences of old prime numbers, see A030016, A075526.
Other counts of prime indices:
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
    Select[Range[1000],Length[Select[prix[#],#==1||PrimeQ[#]&]]==1&]

A376651 Points of upward concavity in the sequence of composite numbers (A002808).

Original entry on oeis.org

4, 8, 12, 17, 23, 26, 30, 35, 40, 46, 49, 55, 58, 63, 70, 73, 77, 81, 94, 97, 102, 112, 118, 123, 126, 131, 136, 146, 150, 162, 173, 176, 180, 185, 195, 200, 205, 210, 216, 219, 229, 242, 245, 249, 262, 267, 276, 280, 285, 292, 297, 302, 305, 310, 317, 320
Offset: 1

Views

Author

Gus Wiseman, Oct 06 2024

Keywords

Comments

These are points at which the second differences (A073445) are positive.
Also positions of strict ascents in the first differences (A073783) of composite numbers (A002808).

Examples

			The composite numbers are (A002808):
  4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 32, 33, ...
with first differences (A073783):
  2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, ...
with first differences (A073445):
  0, -1, 0, 1, 0, -1, 0, 1, 0, -1, 0, 1, -1, 0, 0, 0, 1, 0, -1, 0, 0, 0, 1, -1, 0, ...
with positive terms at (A376651):
  4, 8, 12, 17, 23, 26, 30, 35, 40, 46, 49, 55, 58, 63, 70, 73, 77, 81, 94, 97, ...
		

Crossrefs

The version for A000002 is A022297, negative A156242.
Partitions into composite numbers are counted by A023895, factorizations A050370.
For first differences we had A065310 or A073783, ones A375929.
These are the positions of positive terms in A073445, negative A376652.
For prime instead of composite we have A258025, negative A258026.
For zero second differences (instead of positive) we have A376602.
For composite numbers: A002808 (terms), A073783 (first differences), A073445 (second differences), A376602 (inflections and undulations), A376603 (nonzero curvature), A376652 (concave-down).

Programs

  • Mathematica
    Join@@Position[Sign[Differences[Select[Range[1000],CompositeQ],2]],1]
Showing 1-10 of 26 results. Next