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-20 of 29 results. Next

A380957 Sorted positions of first appearances in A380955 (sum of prime indices minus sum of distinct prime indices).

Original entry on oeis.org

1, 4, 8, 16, 27, 64, 81, 243, 256, 529, 729, 961, 1369, 1681, 1849, 2209, 2809, 3481, 3721, 4489, 5041, 5329, 6241, 6889, 7921, 9409, 10201, 10609, 11449, 11881, 12769, 16129, 17161, 18769, 19321, 22201, 22801, 24649, 26569, 27889, 29929, 32041, 32761, 36481
Offset: 1

Views

Author

Gus Wiseman, Feb 13 2025

Keywords

Comments

Also appears to be sorted firsts of A374248.

Crossrefs

For length instead of sum we have A151821.
Counting partitions by this statistic (sum minus sum of distinct parts) gives A364916.
Sorted positions of first appearances in A380955.
The unsorted version is A380956.
For product instead of sum we have sorted firsts of A380986.
The multiplicative version is A380988, unsorted A380987, firsts of A290106.
For prime multiplicities instead of prime indices we have A380989, firsts of A380958.
For factors instead of indices we have A381075, see A280286, A280292.
A000040 lists the primes, differences A001223.
A005117 lists squarefree numbers, complement A013929.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Cf. A000720, A046660, A071625, A075255, A116861, A136565, A156061, A178503, A175508, A325033, A366528, A366749, A374248.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
q=Table[Total[prix[n]]-Total[Union[prix[n]]],{n,1000}];
Select[Range[Length[q]],FreeQ[Take[q,#-1],q[[#]]]&]

A366844 Number of strict integer partitions of n into odd relatively prime parts.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 1, 0, 2, 1, 2, 1, 2, 2, 3, 3, 5, 4, 4, 5, 6, 7, 8, 8, 9, 11, 12, 12, 15, 16, 15, 19, 23, 23, 26, 28, 30, 34, 37, 38, 44, 48, 48, 56, 62, 63, 72, 77, 82, 92, 96, 102, 116, 124, 128, 142, 155, 162, 178, 191, 200, 222, 236, 246, 276, 291, 303, 334
Offset: 0

Views

Author

Gus Wiseman, Oct 29 2023

Keywords

Examples

			The a(n) partitions for n = 1, 8, 14, 17, 16, 20, 21:
  (1)  (5,3)  (9,5)   (9,5,3)   (9,7)      (11,9)      (9,7,5)
       (7,1)  (11,3)  (9,7,1)   (11,5)     (13,7)      (11,7,3)
              (13,1)  (11,5,1)  (13,3)     (17,3)      (11,9,1)
                      (13,3,1)  (15,1)     (19,1)      (13,5,3)
                                (7,5,3,1)  (9,7,3,1)   (13,7,1)
                                           (11,5,3,1)  (15,5,1)
                                                       (17,3,1)

Crossrefs

This is the relatively prime case of A000700.
The pairwise coprime version is the odd-part case of A007360.
Allowing even parts gives A078374.
The halved even version is A078374 aerated.
The non-strict version is A366843, with evens A000837.
The complement is counted by the strict case of A366852, with evens A018783.
A000041 counts integer partitions, strict A000009 (also into odds).
A051424 counts pairwise coprime partitions, for odd parts A366853.
A113685 counts partitions by sum of odd parts, rank statistic A366528.
A168532 counts partitions by gcd.
A366842 counts partitions whose odd parts have a common divisor > 1.
Cf. A007359, A047967, A055922, A066208, A116598, A239261, A302697, A337485, A365067, A366845, A366848.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], And@@OddQ/@#&&UnsameQ@@#&&GCD@@#==1&]],{n,0,30}]
  • Python
    from math import gcd
from sympy.utilities.iterables import partitions
def A366844(n): return sum(1 for p in partitions(n) if all(d==1 for d in p.values()) and all(d&1 for d in p) and gcd(*p)==1) # Chai Wah Wu, Oct 30 2023

Extensions

More terms from Chai Wah Wu, Oct 30 2023

A019507 Droll numbers: numbers > 1 whose sum of even prime factors equals the sum of odd prime factors.

Original entry on oeis.org

72, 240, 672, 800, 2240, 4224, 5184, 6272, 9984, 14080, 17280, 33280, 39424, 48384, 52224, 57600, 93184, 116736, 161280, 174080, 192000, 247808, 304128, 373248, 389120, 451584, 487424, 537600, 565248, 585728, 640000, 718848, 1013760, 1089536, 1244160, 1384448
Offset: 1

Views

Author

Mario Velucchi (mathchess(AT)velucchi.it)

Keywords

Examples

			6272 = 2*2*2*2*2*2*2*7*7 is droll since 2+2+2+2+2+2+2 = 14 = 7+7.

Links

Crossrefs

For count instead of sum we have A072978.
Partitions of this type are counted by A239261, without zero terms A249914.
For prime indices instead of factors we have A366748, zeros of A366749.
The LHS is A366839 with alternating zeros, for indices A366531, triangle A113686.
The RHS is A366840, for indices A366528, triangle A113685.
A000009 counts partitions into odd parts, ranks A066208.
A035363 counts partitions into even parts, ranks A066207.
A112798 lists prime indices, length A001222, sum A056239.
A257991 counts odd prime indices, even A257992.
A300061 lists numbers with even sum of prime indices, odd A300063.
Cf. A028260, A045931, A100367, A106529, A195017, A239241, A241638, A325698, A325700, A366533.

Programs

  • Maple
    f:= proc(k, m) # numbers whose sum of prime factors >= m is k; m is prime
   local S,p,j;
   option remember;
   if k = 0 then return [1]
   elif m > k then return []
   fi;
   S:= NULL:
   p:= nextprime(m);
   for j from k by -m to 0 do
     S:= S, op(map(`*`,  procname(j,p) , m^((k-j)/m)))
   od;
   [S]
end proc:
g:= proc(N) local m,R;
  R:= NULL;
  for m from 1 while 2^m < N do
   R:= R, op(map(`*`,select(`<=`,f(2*m,3), N/2^m),2^m));
  od;
  sort([R])
end proc:
g(10^8); # Robert Israel, Feb 20 2025
  • Mathematica
    Select[Range[2, 2*10^6, 2], First[#] == Total[Rest[#]] & [Times @@@ FactorInteger[#]] &] (* Paolo Xausa, Feb 19 2025 *)
  • PARI
    isok(n) = {if (n % 2, return (0)); f = factor(n); return (2*f[1,2] == sum(i=2, #f~, f[i,1]*f[i,2]));} \\ Michel Marcus, Jun 21 2013

Formula

These are even numbers k such that A366839(k/2) = A366840(k). - Gus Wiseman, Oct 25 2023 (corrected Feb 19 2025)

Extensions

Name edited by Paolo Xausa, Feb 19 2025

A366749 Self-signed alternating sum of the prime indices of n.

Original entry on oeis.org

0, -1, 2, -2, -3, 1, 4, -3, 4, -4, -5, 0, 6, 3, -1, -4, -7, 3, 8, -5, 6, -6, -9, -1, -6, 5, 6, 2, 10, -2, -11, -5, -3, -8, 1, 2, 12, 7, 8, -6, -13, 5, 14, -7, 1, -10, -15, -2, 8, -7, -5, 4, 16, 5, -8, 1, 10, 9, -17, -3, 18, -12, 8, -6, 3, -4, -19, -9, -7, 0
Offset: 1

Views

Author

Gus Wiseman, Oct 23 2023

Keywords

Comments

We define the self-signed alternating sum of a multiset y to be Sum_{k in y} k*(-1)^k.
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.

Crossrefs

With summands of 2^(n-1) we get A048675.
With summands of (-1)^k we get A195017.
The version for alternating prime indices is A346697 - A346698 = A316524.
Positions of zeros are A366748, counted by A239261.
A112798 lists prime indices, length A001222, sum A056239, reverse A296150.
A300061 lists numbers with even sum of prime indices, odd A300063.
A366528 adds up odd prime indices, counted by A113685.
A366531 adds up even prime indices, counted by A113686.
Cf. A000720, A019507, A045931, A055396, A061395, A325698, A325700, A366533.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
asum[y_]:=Sum[x*(-1)^x,{x,y}];
Table[asum[prix[n]],{n,100}]

Formula

a(n) = Sum_{k in A112798(n)} k*(-1)^k.
a(n) = A366531(n) - A366528(n).

A366848 Odd numbers whose odd prime indices are relatively prime.

Original entry on oeis.org

55, 85, 155, 165, 187, 205, 253, 255, 275, 295, 335, 341, 385, 391, 415, 425, 451, 465, 485, 495, 527, 545, 561, 595, 605, 615, 635, 649, 697, 713, 715, 737, 745, 759, 765, 775, 785, 799, 803, 825, 885, 895, 913, 935, 943, 955, 1003, 1005, 1023, 1025, 1045
Offset: 1

Views

Author

Gus Wiseman, Nov 01 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.

Examples

			The odd prime indices of 345 are {3,9}, which are not relatively prime, so 345 is not in the sequence.
The odd prime indices of 825 are {3,3,5}, which are relatively prime, so 825 is in the sequence
The terms together with their prime indices begin:
    55: {3,5}
    85: {3,7}
   155: {3,11}
   165: {2,3,5}
   187: {5,7}
   205: {3,13}
   253: {5,9}
   255: {2,3,7}
   275: {3,3,5}
   295: {3,17}
   335: {3,19}
   341: {5,11}
   385: {3,4,5}
   391: {7,9}
   415: {3,23}
   425: {3,3,7}
   451: {5,13}
   465: {2,3,11}
   485: {3,25}
   495: {2,2,3,5}

Crossrefs

Including even terms and prime indices gives A289509, ones of A289508, counted by A000837.
Including even prime indices gives A302697, counted by A302698.
Including even terms gives A366846, counted by A366850.
For halved even instead of odd prime indices we have A366849.
A000041 counts integer partitions, strict A000009 (also into odds).
A066208 lists numbers with all odd prime indices, even A066207.
A112798 lists prime indices, length A001222, sum A056239.
A257991 counts odd prime indices, even A257992.
A366528 adds up odd prime indices, partition triangle A113685.
A366531 = 2*A366533 adds up even prime indices, triangle A113686/A174713.
Cf. A000720, A018783, A055396, A061395, A087436, A325698, A365067, A366842, A366843, A366844, A366847.

Programs

  • Mathematica
    Select[Range[1000], OddQ[#]&&GCD@@Select[PrimePi/@First/@FactorInteger[#], OddQ]==1&]

A366850 Number of integer partitions of n whose odd parts are relatively prime.

Original entry on oeis.org

0, 1, 1, 2, 3, 5, 7, 11, 16, 22, 32, 43, 60, 80, 110, 140, 194, 244, 327, 410, 544, 670, 883, 1081, 1401, 1708, 2195, 2651, 3382, 4069, 5129, 6157, 7708, 9194, 11438, 13599, 16788, 19911, 24432, 28858, 35229, 41507, 50359, 59201, 71489, 83776, 100731, 117784
Offset: 0

Views

Author

Gus Wiseman, Oct 28 2023

Keywords

Examples

			The a(1) = 1 through a(8) = 16 partitions:
  (1)  (11)  (21)   (31)    (41)     (51)      (61)       (53)
             (111)  (211)   (221)    (321)     (331)      (71)
                    (1111)  (311)    (411)     (421)      (431)
                            (2111)   (2211)    (511)      (521)
                            (11111)  (3111)    (2221)     (611)
                                     (21111)   (3211)     (3221)
                                     (111111)  (4111)     (3311)
                                               (22111)    (4211)
                                               (31111)    (5111)
                                               (211111)   (22211)
                                               (1111111)  (32111)
                                                          (41111)
                                                          (221111)
                                                          (311111)
                                                          (2111111)
                                                          (11111111)

Crossrefs

For all parts (not just odd) we have A000837, complement A018783.
The complement is counted by A366842.
These partitions have ranks A366846.
A000041 counts integer partitions, strict A000009 (also into odds).
A000740 counts relatively prime compositions.
A078374 counts relatively prime strict partitions.
A113685 counts partitions by sum of odd parts, rank statistic A366528.
A168532 counts partitions by gcd.
A239261 counts partitions with (sum of odd parts) = (sum of even parts).
Cf. A007359, A047967, A051424, A066208, A116598, A365067, A366843, A366844, A366845, A366848.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],GCD@@Select[#,OddQ]==1&]],{n,0,30}]

A366846 Numbers whose odd prime indices are relatively prime.

Original entry on oeis.org

2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 55, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 85, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120, 122
Offset: 1

Views

Author

Gus Wiseman, Oct 29 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.

Examples

			The odd prime indices of 115 are {3,9}, and these are not relatively prime, so 115 is not in the sequence.
The odd prime indices of 825 are {3,3,5}, and these are relatively prime, so 825 is in the sequence.

Crossrefs

Including even indices gives A289509, ones of A289508, counted by A000837.
The complement when including even indices is A318978, counted by A018783.
The nonzero complement ranks the partitions counted by A366842.
The version for halved even indices is A366847.
The odd case is A366848.
The partitions with these Heinz numbers are counted by A366850.
A000041 counts integer partitions, strict A000009 (also into odds).
A112798 lists prime indices, length A001222, sum A056239.
A257992 counts even prime indices, odd A257991.
A366528 adds up odd prime indices, partition triangle A113685.
A366531 = 2*A366533 adds up even prime indices, triangle A113686/A174713.
Cf. A000720, A055396, A061395, A066208, A087436, A302696, A302697, A325698, A366843, A366844, A366849.

Programs

  • Mathematica
    Select[Range[100], GCD@@Select[PrimePi/@First/@FactorInteger[#], OddQ]==1&]

A366849 Odd numbers whose halved even prime indices are relatively prime.

Original entry on oeis.org

3, 9, 15, 21, 27, 33, 39, 45, 51, 57, 63, 69, 75, 81, 87, 91, 93, 99, 105, 111, 117, 123, 129, 135, 141, 147, 153, 159, 165, 171, 177, 183, 189, 195, 201, 203, 207, 213, 219, 225, 231, 237, 243, 247, 249, 255, 261, 267, 273, 279, 285, 291, 297, 301, 303, 309
Offset: 1

Views

Author

Gus Wiseman, Nov 01 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.

Examples

			The even prime indices of 91 are {4,6}, halved {2,3}, which are relatively prime, so 91 is in the sequence.
The prime indices of 665 are {3,4,8}, even {4,8}, halved {2,4}, which are not relatively prime, so 665 is not in the sequence.
The terms together with their prime indices begin:
   3: {2}
   9: {2,2}
  15: {2,3}
  21: {2,4}
  27: {2,2,2}
  33: {2,5}
  39: {2,6}
  45: {2,2,3}
  51: {2,7}
  57: {2,8}
  63: {2,2,4}
  69: {2,9}
  75: {2,3,3}
  81: {2,2,2,2}
  87: {2,10}
  91: {4,6}
  93: {2,11}
  99: {2,2,5}

Crossrefs

For odd instead of halved even prime indices we have A366848.
A version for odd indices A366846, counted by A366850.
This is the odd restriction of A366847, counted by A366845.
A000041 counts integer partitions, strict A000009 (also into odds).
A035363 counts partitions into all even parts, ranks A066207.
A112798 lists prime indices, length A001222, sum A056239.
A162641 counts even prime exponents, odd A162642.
A257992 counts even prime indices, odd A257991.
A289509 lists numbers with relatively prime prime indices, ones of A289508, counted by A000837.
A366528 adds up odd prime indices, partition triangle A113685.
A366531 = 2*A366533 adds up even prime indices, triangle A113686/A174713.
Cf. A000720, A055396, A061395, A066208, A302697, A325698, A366842, A366843.

Programs

  • Mathematica
    Select[Range[100], OddQ[#]&&GCD@@Select[PrimePi/@First/@FactorInteger[#], EvenQ]==2&]

A366852 Number of integer partitions of n into odd parts with a common divisor > 1.

Original entry on oeis.org

0, 0, 0, 1, 0, 1, 1, 1, 0, 2, 1, 1, 2, 1, 1, 4, 0, 1, 4, 1, 2, 6, 1, 1, 6, 3, 1, 8, 2, 1, 13, 1, 0, 13, 1, 7, 15, 1, 1, 19, 6, 1, 25, 1, 2, 33, 1, 1, 32, 5, 10, 39, 2, 1, 46, 14, 6, 55, 1, 1, 77, 1, 1, 82, 0, 20, 92, 1, 2, 105, 31, 1, 122, 1, 1, 166, 2, 16, 168
Offset: 0

Views

Author

Gus Wiseman, Nov 01 2023

Keywords

Examples

			The a(n) partitions for n = 3, 9, 15, 21, 25, 27:
(3)  (9)      (15)         (21)             (25)         (27)
     (3,3,3)  (5,5,5)      (7,7,7)          (15,5,5)     (9,9,9)
              (9,3,3)      (9,9,3)          (5,5,5,5,5)  (15,9,3)
              (3,3,3,3,3)  (15,3,3)                      (21,3,3)
                           (9,3,3,3,3)                   (9,9,3,3,3)
                           (3,3,3,3,3,3,3)               (15,3,3,3,3)
                                                         (9,3,3,3,3,3,3)
                                                         (3,3,3,3,3,3,3,3,3)

Links

Crossrefs

Allowing even parts gives A018783, complement A000837.
For parts > 1 instead of gcd > 1 we have A087897.
For gcd = 1 instead of gcd > 1 we have A366843.
The strict case is A366750, with evens A303280.
The strict complement is A366844, with evens A078374.
A000041 counts integer partitions, strict A000009 (also into odd parts).
A000700 counts strict partitions into odd parts.
A113685 counts partitions by sum of odd parts, rank statistic A366528.
A168532 counts partitions by gcd.
A366842 counts partitions whose odd parts have a common divisor > 1.
Cf. A007359, A047967, A051424, A055922, A066208, A302698, A337485, A365067, A366845, A366848.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],And@@OddQ/@#&&GCD@@#>1&]],{n,15}]
  • Python
    from math import gcd
from sympy.utilities.iterables import partitions
def A366852(n): return sum(1 for p in partitions(n) if all(d&1 for d in p) and gcd(*p)>1) # Chai Wah Wu, Nov 02 2023

Extensions

More terms from Chai Wah Wu, Nov 02 2023
a(0)=0 prepended by Alois P. Heinz, Jan 11 2024

A366321 Numbers m whose prime indices have even sum k such that k/2 is not a prime index of m.

Original entry on oeis.org

1, 3, 7, 10, 13, 16, 19, 21, 22, 27, 28, 29, 34, 36, 37, 39, 43, 46, 48, 52, 53, 55, 57, 61, 62, 64, 66, 71, 75, 76, 79, 81, 82, 85, 87, 88, 89, 90, 91, 94, 100, 101, 102, 107, 108, 111, 113, 115, 116, 117, 118, 120, 129, 130, 131, 133, 134, 136, 138, 139, 144
Offset: 0

Views

Author

Gus Wiseman, Oct 13 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.

Examples

			The prime indices of 84 are y = {1,1,2,4}, with even sum 8; but 8/2 = 4 is in y, so 84 is not in the sequence.
The terms together with their prime indices begin:
    1: {}
    3: {2}
    7: {4}
   10: {1,3}
   13: {6}
   16: {1,1,1,1}
   19: {8}
   21: {2,4}
   22: {1,5}
   27: {2,2,2}
   28: {1,1,4}
   29: {10}
   34: {1,7}
   36: {1,1,2,2}

Crossrefs

Partitions of this type are counted by A182616, strict A365828.
A066207 lists numbers with all even prime indices, odd A066208.
A086543 lists numbers with at least one odd prime index, counted by A366322.
A300063 ranks partitions of odd numbers.
A366319 ranks partitions of n not containing n/2.
A366321 ranks partitions of 2k that do not contain k.
Cf. A000041, A006827, A047967, A320924, A339662, A365825, A365920, A366318, A366528, A366530.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],EvenQ[Total[prix[#]]]&&FreeQ[prix[#],Total[prix[#]]/2]&]
Previous Showing 11-20 of 29 results. Next

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

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