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 27 results. Next

A363719 Number of integer partitions of n satisfying (mean) = (median) = (mode), assuming there is a unique mode.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 5, 3, 5, 2, 10, 2, 7, 7, 12, 2, 18, 2, 24, 16, 13, 2, 58, 15, 18, 37, 60, 2, 123, 2, 98, 79, 35, 103, 332, 2, 49, 166, 451, 2, 515, 2, 473, 738, 92, 2, 1561, 277, 839, 631, 1234, 2, 2043, 1560, 2867, 1156, 225, 2, 9020
Offset: 1

Views

Author

Gus Wiseman, Jun 19 2023

Keywords

Comments

The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes of {a,a,b,b,b,c,d,d,d} are {b,d}.
Without loss of generality, we may assume there is a unique middle-part (A238478).
Includes all constant partitions.

Examples

			The a(n) partitions for n = 1, 2, 4, 6, 8, 12, 14, 16 (A..G = 10..16):
  1  2   4     6       8         C             E               G
     11  22    33      44        66            77              88
         1111  222     2222      444           2222222         4444
               111111  3221      3333          3222221         5443
                       11111111  4332          3322211         6442
                                 5331          4222211         7441
                                 222222        11111111111111  22222222
                                 322221                        32222221
                                 422211                        33222211
                                 111111111111                  42222211
                                                               52222111
                                                               1^16

Crossrefs

For unequal instead of equal: A363720, ranks A363730, unique mode A363725.
The odd-length case is A363721.
These partitions have ranks A363727, nonprime A363722.
The case of non-constant partitions is A363728, ranks A363729.
The version for factorizations is A363741, see A359909, A359910.
Just two statistics:
- (mean) = (median) gives A240219, also A359889, A359895, A359897, A359899.
- (mean) != (median) gives A359894, also A359890, A359896, A359898, A359900.
- (mean) = (mode) gives A363723, see A363724, A363731.
- (median) = (mode) gives A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A027193, A237984, A325347, A326567/A326568, A327472, A363726, A363742.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n], {Mean[#]}=={Median[#]}==modes[#]&]],{n,30}]

A360245 Number of integer partitions of n where the parts have the same median as the distinct parts.

Original entry on oeis.org

1, 1, 2, 3, 4, 4, 8, 6, 11, 13, 19, 19, 35, 33, 48, 66, 78, 88, 124, 138, 183, 219, 252, 306, 388, 450, 527, 643, 780, 903, 1097, 1266, 1523, 1784, 2107, 2511, 2966, 3407, 4019, 4667, 5559, 6364, 7492, 8601, 10063, 11634, 13469, 15469, 17985, 20558, 23812
Offset: 0

Views

Author

Gus Wiseman, Feb 05 2023

Keywords

Comments

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 a(1) = 1 through a(8) = 11 partitions:
  (1)  (2)   (3)    (4)     (5)      (6)       (7)        (8)
       (11)  (21)   (22)    (32)     (33)      (43)       (44)
             (111)  (31)    (41)     (42)      (52)       (53)
                    (1111)  (11111)  (51)      (61)       (62)
                                     (222)     (421)      (71)
                                     (321)     (1111111)  (431)
                                     (2211)               (521)
                                     (111111)             (2222)
                                                          (3221)
                                                          (3311)
                                                          (11111111)
For example, the partition y = (6,4,4,4,1,1) has median 4, and the distinct parts {1,4,6} also have median 4, so y is counted under a(20).

Crossrefs

For mean instead of median: A360242, ranks A360247, complement A360243.
These partitions have ranks A360249.
The complement is A360244, ranks A360248.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A325347 counts partitions w/ integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A027193, A067659, A326619/A326620, A326621, A359902, A360241, A360246, A360250, A360251.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n], Median[#]==Median[Union[#]]&]],{n,0,30}]

A363720 Number of integer partitions of n with different mean, median, and mode.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 2, 3, 5, 7, 16, 17, 34, 38, 50, 79, 115, 123, 198, 220, 291, 399, 536, 605, 815, 1036, 1241, 1520, 2059, 2315, 3132, 3708, 4491, 5668, 6587, 7788, 10259, 12299, 14515, 17153, 21558, 24623, 30876, 35540, 41476, 52023, 61931, 70811, 85545
Offset: 0

Views

Author

Gus Wiseman, Jun 21 2023

Keywords

Comments

If there are multiple modes, then the mode is automatically considered different from the mean and median; otherwise, we take the unique mode.
The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length).
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes of {a,a,b,b,b,c,d,d,d} are {b,d}.

Examples

			The a(7) = 2 through a(11) = 16 partitions:
  (421)   (431)   (621)    (532)     (542)
  (3211)  (521)   (3321)   (541)     (632)
          (4211)  (4311)   (631)     (641)
                  (5211)   (721)     (731)
                  (32211)  (5311)    (821)
                           (6211)    (4322)
                           (322111)  (4421)
                                     (5321)
                                     (5411)
                                     (6311)
                                     (7211)
                                     (33221)
                                     (43211)
                                     (52211)
                                     (332111)
                                     (422111)

Crossrefs

For equal instead of unequal: A363719, ranks A363727, odd-length A363721.
The case of a unique mode is A363725.
These partitions have ranks A363730.
For factorizations we have A363742, for equal A363741, see A359909, A359910.
Just two statistics:
- (mean) = (median) gives A240219, also A359889, A359895, A359897, A359899.
- (mean) != (median) gives A359894, also A359890, A359896, A359898, A359900.
- (mean) = (mode) gives A363723, see A363724, A363731.
- (median) = (mode) gives A363740.
A000041 counts partitions, strict A000009.
A008284 counts partitions by length (or negative mean), strict A008289.
A359893 and A359901 count partitions by median, odd-length A359902.
A362608 counts partitions with a unique mode.
Cf. A027193, A237984, A325347, A326567/A326568, A327472, A363726, A363728.

Programs

  • Mathematica
    modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Table[Length[Select[IntegerPartitions[n],{Mean[#]}!={Median[#]}!=modes[#]&]],{n,0,30}]

A360007 Positions of first appearances in the sequence giving the median of the prime indices of n (A360005(n)/2).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 11, 13, 14, 17, 19, 23, 26, 29, 31, 37, 38, 41, 43, 47, 53, 58, 59, 61, 67, 71, 73, 74, 79, 83, 86, 89, 97, 101, 103, 106, 107, 109, 113, 122, 127, 131, 137, 139, 142, 149, 151, 157, 158, 163, 167, 173, 178, 179, 181, 191, 193, 197, 199, 202
Offset: 1

Views

Author

Gus Wiseman, Jan 24 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).

Crossrefs

Positions of first appearances in A360005.
The unsorted version is A360006.
For mean instead of median we have A360008.
A112798 lists prime indices, length A001222, sum A056239.
A316413 lists numbers whose prime indices have integer mean.
A325347 = partitions w/ integer median, strict A359907, complement A307683.
A326567/A326568 gives mean of prime indices.
A359893 counts partitions by median, cf. A359901, A359902.
A359908 = numbers w/ integer median of prime indices, complement A359912.
Cf. A026424, A359889, A359890, A360009.

Programs

  • Mathematica
    nn=1000;
prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
seq=Table[If[n==1,1,2*Median[prix[n]]],{n,nn}];
Select[Range[nn],FreeQ[seq[[Range[#-1]]],seq[[#]]]&]

Formula

Consists of 1, the primes, and all odd-indexed primes times 2.

A360453 Numbers for which the prime multiplicities (or sorted signature) have the same median as the distinct prime indices.

Original entry on oeis.org

1, 2, 9, 12, 18, 40, 100, 112, 125, 180, 250, 252, 300, 352, 360, 392, 396, 405, 450, 468, 504, 540, 588, 600, 612, 675, 684, 720, 756, 792, 828, 832, 882, 900, 936, 1008, 1044, 1116, 1125, 1176, 1188, 1200, 1224, 1332, 1350, 1368, 1372, 1404, 1440, 1452, 1476
Offset: 1

Views

Author

Gus Wiseman, Feb 10 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 terms together with their prime indices begin:
    1: {}
    2: {1}
    9: {2,2}
   12: {1,1,2}
   18: {1,2,2}
   40: {1,1,1,3}
  100: {1,1,3,3}
  112: {1,1,1,1,4}
  125: {3,3,3}
  180: {1,1,2,2,3}
  250: {1,3,3,3}
  252: {1,1,2,2,4}
  300: {1,1,2,3,3}
  352: {1,1,1,1,1,5}
  360: {1,1,1,2,2,3}
For example, the prime indices of 756 are {1,1,2,2,2,4} with distinct parts {1,2,4} with median 2 and multiplicities {1,2,3} with median 2, so 756 is in the sequence.

Crossrefs

Without taking median we have A109298, unordered A109297.
For mean instead of median we have A324570, counted by A114638.
For indices instead of multiplicities we have A360249, counted by A360245.
For indices instead of distinct indices we have A360454, counted by A360456.
These partitions are counted by A360455.
A088529/A088530 gives mean of prime signature A124010.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranks A359889.
A316413 = numbers whose prime indices have integer mean, distinct A326621.
A325347 = partitions with integer median, strict A359907, ranks A359908.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A359893 and A359901 count partitions by median.
A360005 gives median of prime indices (times two).
Cf. A000975, A359890, A359903, A360068, A360244, A360247, A360248.

Programs

  • Mathematica
    Select[Range[100],#==1||Median[Last/@FactorInteger[#]]== Median[PrimePi/@First/@FactorInteger[#]]&]

A359913 Numbers whose multiset of prime factors has integer median.

Original entry on oeis.org

2, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 18, 19, 20, 21, 23, 24, 25, 27, 28, 29, 30, 31, 32, 33, 35, 37, 39, 40, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 59, 61, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 75, 76, 77, 78, 79, 80, 81
Offset: 1

Views

Author

Gus Wiseman, Jan 25 2023

Keywords

Comments

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 terms together with their prime factors begin:
   2: {2}
   3: {3}
   4: {2,2}
   5: {5}
   7: {7}
   8: {2,2,2}
   9: {3,3}
  11: {11}
  12: {2,2,3}
  13: {13}
  15: {3,5}
  16: {2,2,2,2}
  17: {17}
  18: {2,3,3}
  19: {19}
  20: {2,2,5}
  21: {3,7}
  23: {23}
  24: {2,2,2,3}

Crossrefs

Prime factors are listed by A027746.
The complement is A072978, for prime indices A359912.
For mean instead of median we have A078175, for prime indices A316413.
For prime indices instead of factors we have A359908, counted by A325347.
Positions of even terms in A360005.
A067340 lists numbers whose prime signature has integer mean.
A112798 lists prime indices, length A001222, sum A056239.
A325347 counts partitions with integer median, strict A359907.
A326567/A326568 gives the mean of prime indices, conjugate A326839/A326840.
A359893 and A359901 count partitions by median, odd-length A359902.
Cf. A067538, A175352, A348551, A359890, A359905, A360007, A360006, A360069.

Programs

  • Mathematica
    Select[Range[2,100],IntegerQ[Median[Flatten[ConstantArray@@@FactorInteger[#]]]]&]

A360249 Numbers for which the prime indices have the same median as the distinct prime indices.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 46, 47, 49, 51, 53, 55, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 81, 82, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 97, 100, 101, 102, 103, 105, 106, 107, 109, 110, 111, 113, 114, 115, 118, 119, 121, 122, 123, 125, 126, 127, 128, 129, 130
Offset: 1

Views

Author

Gus Wiseman, Feb 07 2023

Keywords

Comments

First differs from A072774 in having 90.
First differs from A242414 in having 180.
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 prime indices of 126 are {1,2,2,4} with median 2 and distinct prime indices {1,2,4} with median 2, so 126 is in the sequence.
The prime indices of 180 are {1,1,2,2,3} with median 2 and distinct prime indices {1,2,3} with median 2, so 180 is in the sequence.

Crossrefs

These partitions are counted by A360245.
The complement for mean instead of median is A360246, counted by A360242.
For mean instead of median we have A360247, counted by A360243.
The complement is A360248, counted by A360244.
For multiplicities instead of parts: A360453, counted by A360455.
For multiplicities instead of distinct parts: A360454, counted by A360456.
A112798 lists prime indices, length A001222, sum A056239.
A240219 counts partitions with mean equal to median, ranks A359889.
A326567/A326568 gives mean of prime indices.
A326619/A326620 gives mean of distinct prime indices.
A325347 = partitions with integer median, strict A359907, ranks A359908.
A359893 and A359901 count partitions by median.
A359894 = partitions with mean different from median, ranks A359890.
A360005 gives median of prime indices (times two).
Cf. A000975, A078174, A316413, A324570, A359903, A360252, A360253.

Programs

  • Maple
    isA360249 := proc(n)
    local ifs,pidx,pe,medAll,medDist ;
    if n = 1 then
        return true ;
    end if ;
    ifs := ifactors(n)[2] ;
    pidx := [] ;
    for pe in ifs do
        numtheory[pi](op(1,pe)) ;
        pidx := [op(pidx),seq(%,i=1..op(2,pe))] ;
    end do:
    medAll := stats[describe,median](sort(pidx)) ;
    pidx := convert(convert(pidx,set),list) ;
    medDist := stats[describe,median](sort(pidx)) ;
    if medAll = medDist then
        true;
    else
        false;
    end if;
end proc:
for n from 1 to 130 do
    if isA360249(n) then
        printf("%d,",n) ;
    end if;
end do: # R. J. Mathar, May 22 2023
  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Select[Range[100],Median[prix[#]]==Median[Union[prix[#]]]&]

A360250 Number of integer partitions of n where the parts have greater mean than the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 0, 1, 0, 2, 2, 3, 3, 9, 5, 13, 15, 18, 20, 37, 34, 59, 51, 68, 92, 134, 121, 167, 203, 251, 282, 387, 375, 537, 561, 714, 888, 958, 1042, 1408, 1618, 1939, 2076, 2650, 2764, 3479, 3863, 4431, 5387, 6520, 6688, 8098, 9041, 10614, 12084, 14773, 15469
Offset: 0

Views

Author

Gus Wiseman, Feb 06 2023

Keywords

Examples

			The a(5) = 1 through a(12) = 5 partitions:
  (221)  .  (331)   (332)    (441)    (442)     (443)      (552)
            (2221)  (22211)  (3321)   (3331)    (551)      (4431)
                             (22221)  (222211)  (3332)     (33321)
                                                (4331)     (44211)
                                                (4421)     (2222211)
                                                (33221)
                                                (33311)
                                                (222221)
                                                (2222111)
For example, the partition y = (4,3,3,1) has mean 11/4 and distinct parts {1,3,4} with mean 8/5, so y is counted under a(11).

Crossrefs

For unequal instead of greater we have A360242, ranks A360246.
For equal instead of greater we have A360243, ranks A360247.
For less instead of greater we have A360251, ranks A360253.
These partitions have ranks A360252.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A058398 counts partitions by mean, also A327482.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A316313, A326567/A326568, A326619/A326620, A326621, A360068, A360241, A360244, A360245.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]>Mean[Union[#]]&]],{n,0,30}]

Formula

a(n) + A360251(n) = A360242(n).
a(n) + A360251(n) + A360243(n) = A000041(n).

A360251 Number of integer partitions of n where the parts have lesser mean than the distinct parts.

Original entry on oeis.org

0, 0, 0, 0, 1, 2, 3, 7, 9, 16, 22, 34, 44, 69, 88, 118, 163, 221, 280, 376, 473, 619, 800, 1016, 1257, 1621, 2038, 2522, 3117, 3921, 4767, 5964, 7273, 8886, 10838, 13141, 15907, 19468, 23424, 28093, 33656, 40672, 48273, 58171, 68944, 81888, 97596, 115643
Offset: 0

Views

Author

Gus Wiseman, Feb 06 2023

Keywords

Examples

			The a(4) = 1 through a(9) = 16 partitions:
  (211)  (311)   (411)    (322)     (422)      (522)
         (2111)  (3111)   (511)     (611)      (711)
                 (21111)  (3211)    (4211)     (3222)
                          (4111)    (5111)     (4221)
                          (22111)   (32111)    (4311)
                          (31111)   (41111)    (5211)
                          (211111)  (221111)   (6111)
                                    (311111)   (32211)
                                    (2111111)  (33111)
                                               (42111)
                                               (51111)
                                               (321111)
                                               (411111)
                                               (2211111)
                                               (3111111)
                                               (21111111)
For example, the partition y = (4,2,2,1) has mean 9/4 and distinct parts {1,2,4} with mean 7/3, so y is counted under a(9).

Crossrefs

For unequal instead of less we have A360242, ranks A360246.
For equal instead of less we have A360243, ranks A360247.
For greater instead of less we have A360250, ranks A360252.
These partitions have ranks A360253.
A000041 counts integer partitions, strict A000009.
A008284 counts partitions by number of parts.
A058398 counts partitions by mean, also A327482.
A067538 counts partitions with integer mean, strict A102627, ranks A316413.
A116608 counts partitions by number of distinct parts.
A240219 counts partitions with mean equal to median, ranks A359889.
A359894 counts partitions with mean different from median, ranks A359890.
A360071 counts partitions by number of parts and number of distinct parts.
Cf. A000975, A316313, A326567/A326568, A326619/A326620, A326621, A360068, A360241, A360244, A360245.

Programs

  • Mathematica
    Table[Length[Select[IntegerPartitions[n],Mean[#]

Formula

a(n) + A360250(n) = A360242(n).
a(n) + A360250(n) + A360243(n) = A000041(n).

A363730 Numbers whose prime indices have different mean, median, and mode.

Original entry on oeis.org

42, 60, 66, 70, 78, 84, 102, 114, 130, 132, 138, 140, 150, 154, 156, 165, 170, 174, 180, 182, 186, 190, 195, 204, 220, 222, 228, 230, 231, 246, 255, 258, 260, 266, 276, 282, 285, 286, 290, 294, 308, 310, 315, 318, 322, 330, 340, 345, 348, 354, 357, 360, 364
Offset: 1

Views

Author

Gus Wiseman, Jun 24 2023

Keywords

Comments

If there are multiple modes, then the mode is automatically considered different from the mean and median; otherwise, we take the unique mode.
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.
A mode in a multiset is an element that appears at least as many times as each of the others. For example, the modes in {a,a,b,b,b,c,d,d,d} are {b,d}.
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 prime indices of 180 are {1,1,2,2,3}, with mean 9/5, median 2, modes {1,2}, so 180 is in the sequence.
The prime indices of 108 are {1,1,2,2,2}, with mean 8/5, median 2, modes {2}, so 108 is not in the sequence.
The terms together with their prime indices begin:
   42: {1,2,4}
   60: {1,1,2,3}
   66: {1,2,5}
   70: {1,3,4}
   78: {1,2,6}
   84: {1,1,2,4}
  102: {1,2,7}
  114: {1,2,8}
  130: {1,3,6}
  132: {1,1,2,5}
  138: {1,2,9}
  140: {1,1,3,4}
  150: {1,2,3,3}

Crossrefs

These partitions are counted by A363720
For equal instead of unequal we have A363727, counted by A363719.
The version for factorizations is A363742, equal A363741.
A112798 lists prime indices, length A001222, sum A056239.
A326567/A326568 gives mean of prime indices.
A356862 ranks partitions with a unique mode, counted by A362608.
A359178 ranks partitions with multiple modes, counted by A362610.
A360005 gives twice the median of prime indices.
A362611 counts modes in prime indices, triangle A362614.
A362613 counts co-modes in prime indices, triangle A362615.
A363486 gives least mode in prime indices, A363487 greatest.
Just two statistics:
- (mean) = (median): A359889, counted by A240219.
- (mean) != (median): A359890, counted by A359894.
- (mean) = (mode): counted by A363723, see A363724, A363731.
- (median) = (mode): counted by A363740.
Cf. A000961, A327473, A327476, A359908, A363722, A363725, A363729.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
modes[ms_]:=Select[Union[ms],Count[ms,#]>=Max@@Length/@Split[ms]&];
Select[Range[100],{Mean[prix[#]]}!={Median[prix[#]]}!=modes[prix[#]]&]

Formula

All three of A326567(a(n))/A326568(a(n)), A360005(a(n))/2, and A363486(a(n)) = A363487(a(n)) are different.
Previous Showing 11-20 of 27 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.