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

A324697 Lexicographically earliest sequence of positive integers > 1 that are prime or whose prime indices already belong to the sequence.

Original entry on oeis.org

2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 23, 25, 27, 29, 31, 33, 37, 41, 43, 45, 47, 51, 53, 55, 59, 61, 67, 69, 71, 73, 75, 79, 81, 83, 85, 89, 93, 97, 99, 101, 103, 107, 109, 113, 115, 121, 123, 125, 127, 131, 135, 137, 139, 141, 149, 151, 153, 155, 157, 163, 165
Offset: 1

Views

Author

Gus Wiseman, Mar 10 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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 sequence of terms together with their prime indices begins:
   2: {1}
   3: {2}
   5: {3}
   7: {4}
   9: {2,2}
  11: {5}
  13: {6}
  15: {2,3}
  17: {7}
  19: {8}
  23: {9}
  25: {3,3}
  27: {2,2,2}
  29: {10}
  31: {11}
  33: {2,5}
  37: {12}
  41: {13}
  43: {14}
  45: {2,2,3}

Crossrefs

Complement of A324705.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324698, A324699, A324700, A324701, A324702, A324703, A324704.

Programs

  • Mathematica
    aQ[n_]:=Switch[n,1,False,?PrimeQ,True,,And@@Cases[FactorInteger[n],{p_,k_}:>aQ[PrimePi[p]]]];
Select[Range[100],aQ]

A324524 Numbers where every prime index divides its multiplicity in the prime factorization. Numbers divisible by a power of prime(k)^k for each prime index k.

Original entry on oeis.org

1, 2, 4, 8, 9, 16, 18, 32, 36, 64, 72, 81, 125, 128, 144, 162, 250, 256, 288, 324, 500, 512, 576, 648, 729, 1000, 1024, 1125, 1152, 1296, 1458, 2000, 2048, 2250, 2304, 2401, 2592, 2916, 4000, 4096, 4500, 4608, 4802, 5184, 5832, 6561, 8000, 8192, 9000, 9216
Offset: 1

Views

Author

Gus Wiseman, Mar 07 2019

Keywords

Comments

These are a kind of self-describing numbers (cf. A001462, A304679).
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 prime signature of a number is the multiset of multiplicities (or exponents) in its prime factorization.
Also Heinz numbers of integer partitions in which every part divides its multiplicity (counted by A001156). The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
Also products of elements of A062457.

Examples

			The sequence of terms together with their prime indices begins as follows. For example, we have 18: {1,2,2} because 18 = prime(1) * prime(2) * prime(2).
    1: {}
    2: {1}
    4: {1,1}
    8: {1,1,1}
    9: {2,2}
   16: {1,1,1,1}
   18: {1,2,2}
   32: {1,1,1,1,1}
   36: {1,1,2,2}
   64: {1,1,1,1,1,1}
   72: {1,1,1,2,2}
   81: {2,2,2,2}
  125: {3,3,3}
  128: {1,1,1,1,1,1,1}
  144: {1,1,1,1,2,2}
  162: {1,2,2,2,2}
  250: {1,3,3,3}
  256: {1,1,1,1,1,1,1,1}

Links

Crossrefs

Cf. A001156, A033461, A056239, A062457, A066328, A072873, A112798, A118914 (prime signature), A124010, A181819, A276078, A304679.
Cf. A109298, A324525, A324570, A324571, A324572, A324587, A324588.
Range of values of A090884.
Sequences related to self-description: A000002, A001462, A079000, A079254, A276625, A304360.

Programs

  • Maple
    q:= n-> andmap(i-> irem(i[2], numtheory[pi](i[1]))=0, ifactors(n)[2]):
select(q, [$1..10000])[];  # Alois P. Heinz, Mar 08 2019
  • Mathematica
    Select[Range[1000],And@@Cases[If[#==1,{},FactorInteger[#]],{p_,k_}:>Divisible[k,PrimePi[p]]]&]
v = Join[{1}, Prime[(r = Range[10])]^r]; n = Length[v]; vmax = 10^4; s = {1}; Do[v1 = v[[k]]; rmax = Floor[Log[v1, vmax]]; s1 = v1^Range[0, rmax]; s2 = Select[Union[Flatten[Outer[Times, s, s1]]], # <= vmax &]; s = Union[s, s2], {k, 2, n}]; Length[s] (* Amiram Eldar, Sep 30 2020 *)

Formula

Closed under multiplication.
Sum_{n>=1} 1/a(n) = Product_{k>=1} 1/(1-prime(k)^(-k)) = 2.26910478689594012492... - Amiram Eldar, Sep 30 2020

A324571 Numbers whose ordered prime signature is equal to the set of distinct prime indices in decreasing order.

Original entry on oeis.org

1, 2, 9, 12, 40, 112, 125, 352, 360, 675, 832, 1008, 2176, 2401, 3168, 3969, 4864, 7488, 11776, 14000, 19584, 29403, 29696, 43776, 44000, 63488, 75600, 104000, 105984, 123201, 151552, 161051, 214375, 237600, 267264, 272000, 335872, 496125, 561600, 571392, 608000
Offset: 1

Views

Author

Gus Wiseman, Mar 08 2019

Keywords

Comments

These are a kind of self-describing numbers (cf. A001462, A304679). The increasing case is A109298.
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 ordered prime signature (A124010) is the sequence of multiplicities (or exponents) in a number's prime factorization, taken in order of the prime base.
Also Heinz numbers of the integer partitions counted by A324572. The Heinz number of an integer partition (y_1, ..., y_k) is prime(y_1) * ... * prime(y_k).
Each finite set of positive integers determines a unique term with those prime indices. For example, corresponding to {1,2,4,5} is 1397088 = prime(1)^5 * prime(2)^4 * prime(4)^2 * prime(5)^1.

Examples

			The sequence of terms together with their prime indices begins as follows. For example, we have 40: {1,1,1,3} because 40 = prime(1) * prime(1) * prime(1) * prime(3).
      1: {}
      2: {1}
      9: {2,2}
     12: {1,1,2}
     40: {1,1,1,3}
    112: {1,1,1,1,4}
    125: {3,3,3}
    352: {1,1,1,1,1,5}
    360: {1,1,1,2,2,3}
    675: {2,2,2,3,3}
    832: {1,1,1,1,1,1,6}
   1008: {1,1,1,1,2,2,4}
   2176: {1,1,1,1,1,1,1,7}
   2401: {4,4,4,4}
   3168: {1,1,1,1,1,2,2,5}
   3969: {2,2,2,2,4,4}
   4864: {1,1,1,1,1,1,1,1,8}
   7488: {1,1,1,1,1,1,2,2,6}
  11776: {1,1,1,1,1,1,1,1,1,9}
  14000: {1,1,1,1,3,3,3,4}
  19584: {1,1,1,1,1,1,1,2,2,7}

Crossrefs

Cf. A001156, A033461, A056239, A062457, A109298, A112798, A117144, A118914, A124010, A181819, A276078.
Cf. A324524, A324525, A324572.
Sequences related to self-description: A000002, A001462, A079000, A079254, A276625, A304360, A304679.

Programs

  • Mathematica
    Select[Range[1000],Reverse[PrimePi/@First/@If[#==1,{},FactorInteger[#]]]==Last/@If[#==1,{},FactorInteger[#]]&]

A324699 Lexicographically earliest sequence of positive integers whose prime indices minus 1 already belong to the sequence.

Original entry on oeis.org

1, 3, 7, 9, 19, 21, 27, 29, 49, 57, 63, 71, 79, 81, 87, 107, 113, 133, 147, 171, 189, 203, 213, 229, 237, 243, 261, 271, 311, 321, 339, 343, 359, 361, 399, 409, 421, 441, 457, 497, 513, 551, 553, 567, 593, 609, 619, 639, 687, 711, 729, 749, 757, 783, 791, 813
Offset: 1

Views

Author

Gus Wiseman, Mar 10 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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 sequence of terms together with their prime indices begins:
    1: {}
    3: {2}
    7: {4}
    9: {2,2}
   19: {8}
   21: {2,4}
   27: {2,2,2}
   29: {10}
   49: {4,4}
   57: {2,8}
   63: {2,2,4}
   71: {20}
   79: {22}
   81: {2,2,2,2}
   87: {2,10}
  107: {28}
  113: {30}
  133: {4,8}
  147: {2,4,4}
  171: {2,2,8}
  189: {2,2,2,4}

Crossrefs

Prime indices are A306719.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360, A306719.
Cf. A324694, A324695, A324696, A324697, A324698, A324700, A324701, A324702, A324703, A324704, A324705.

Programs

Formula

a(n) = A306719(n) - 1.

A324700 Lexicographically earliest sequence containing 0 and all positive integers > 1 whose prime indices minus 1 already belong to the sequence.

Original entry on oeis.org

0, 2, 4, 5, 8, 10, 11, 13, 16, 20, 22, 23, 25, 26, 31, 32, 37, 40, 43, 44, 46, 50, 52, 55, 59, 62, 64, 65, 73, 74, 80, 83, 86, 88, 89, 92, 100, 101, 103, 104, 110, 115, 118, 121, 124, 125, 128, 130, 131, 137, 143, 146, 148, 155, 160, 163, 166, 169, 172, 176
Offset: 1

Views

Author

Gus Wiseman, Mar 10 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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 sequence of terms together with their prime indices begins:
   0
   2: {1}
   4: {1,1}
   5: {3}
   8: {1,1,1}
  10: {1,3}
  11: {5}
  13: {6}
  16: {1,1,1,1}
  20: {1,1,3}
  22: {1,5}
  23: {9}
  25: {3,3}
  26: {1,6}
  31: {11}
  32: {1,1,1,1,1}
  37: {12}
  40: {1,1,1,3}
  43: {14}
  44: {1,1,5}

Crossrefs

Prime indices are A324701.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324697, A324698, A324699, A324702, A324703, A324704, A324705.

Programs

Formula

a(n) = A324701(n) - 1.

A324701 Lexicographically earliest sequence containing 1 and all positive integers n such that the prime indices of n - 1 already belong to the sequence.

Original entry on oeis.org

1, 3, 5, 6, 9, 11, 12, 14, 17, 21, 23, 24, 26, 27, 32, 33, 38, 41, 44, 45, 47, 51, 53, 56, 60, 63, 65, 66, 74, 75, 81, 84, 87, 89, 90, 93, 101, 102, 104, 105, 111, 116, 119, 122, 125, 126, 129, 131, 132, 138, 144, 147, 149, 156, 161, 164, 167, 170, 173, 177
Offset: 1

Views

Author

Gus Wiseman, Mar 10 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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

Prime indices of A324700.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324697, A324698, A324699, A324702, A324703, A324704, A324705.

Programs

Formula

a(n) = A324700(n) + 1.

A324702 Lexicographically earliest sequence containing 2 and all positive integers > 1 whose prime indices minus 1 already belong to the sequence.

Original entry on oeis.org

2, 5, 13, 25, 43, 65, 101, 125, 169, 193, 215, 317, 325, 505, 557, 559, 625, 701, 845, 965, 1013, 1075, 1181, 1313, 1321, 1585, 1625, 1849, 2111, 2161, 2197, 2509, 2525, 2785, 2795, 3125, 3505, 3617, 4049, 4057, 4121, 4225, 4343, 4639, 4825, 5065, 5297, 5375
Offset: 1

Views

Author

Gus Wiseman, Mar 11 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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 2 and numbers whose prime indices belong to A324703.

Examples

			The sequence of terms together with their prime indices begins:
    2: {1}
    5: {3}
   13: {6}
   25: {3,3}
   43: {14}
   65: {3,6}
  101: {26}
  125: {3,3,3}
  169: {6,6}
  193: {44}
  215: {3,14}
  317: {66}
  325: {3,3,6}
  505: {3,26}
  557: {102}
  559: {6,14}
  625: {3,3,3,3}
  701: {126}
  845: {3,6,6}
  965: {3,44}

Crossrefs

Prime indices > 1 are A324703.
Cf. A000002, A000720, A001222, A001462, A007097, A045965, A055396, A061395, A064989, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324697, A324698, A324699, A324700, A324701, A324704, A324705.

Programs

Formula

a(n) = A324703(n) - 1.

A324703 Lexicographically earliest sequence containing 3 and all positive integers n such that the prime indices of n - 1 already belong to the sequence.

Original entry on oeis.org

3, 6, 14, 26, 44, 66, 102, 126, 170, 194, 216, 318, 326, 506, 558, 560, 626, 702, 846, 966, 1014, 1076, 1182, 1314, 1322, 1586, 1626, 1850, 2112, 2162, 2198, 2510, 2526, 2786, 2796, 3126, 3506, 3618, 4050, 4058, 4122, 4226, 4344, 4640, 4826, 5066, 5298, 5376
Offset: 1

Views

Author

Gus Wiseman, Mar 11 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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

Prime indices of A324702.
Cf. A000002, A000720, A001222, A001462, A007097, A045965, A055396, A061395, A064989, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324697, A324698, A324699, A324700, A324701, A324704, A324705.

Programs

Formula

a(n) = A324702(n) + 1.

A324705 Lexicographically earliest sequence containing 1 and all composite numbers divisible by prime(m) for some m already in the sequence.

Original entry on oeis.org

1, 4, 6, 8, 10, 12, 14, 16, 18, 20, 21, 22, 24, 26, 28, 30, 32, 34, 35, 36, 38, 39, 40, 42, 44, 46, 48, 49, 50, 52, 54, 56, 57, 58, 60, 62, 63, 64, 65, 66, 68, 70, 72, 74, 76, 77, 78, 80, 82, 84, 86, 87, 88, 90, 91, 92, 94, 95, 96, 98, 100, 102, 104, 105, 106
Offset: 1

Views

Author

Gus Wiseman, Mar 11 2019

Keywords

Comments

A self-describing sequence, similar to A304360.
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 sequence of terms together with their prime indices begins:
   1: {}
   4: {1,1}
   6: {1,2}
   8: {1,1,1}
  10: {1,3}
  12: {1,1,2}
  14: {1,4}
  16: {1,1,1,1}
  18: {1,2,2}
  20: {1,1,3}
  21: {2,4}
  22: {1,5}
  24: {1,1,1,2}
  26: {1,6}
  28: {1,1,4}
  30: {1,2,3}
  32: {1,1,1,1,1}
  34: {1,7}
  35: {3,4}
  36: {1,1,2,2}

Crossrefs

Complement of A324697.
Cf. A000002, A000720, A001222, A001462, A007097, A055396, A061395, A079000, A079254, A109298, A112798, A276625, A277098, A304360.
Cf. A324694, A324695, A324696, A324698, A324699, A324700, A324701, A324702, A324703, A324704.

Programs

  • Mathematica
    aQ[n_]:=Switch[n,1,True,?PrimeQ,False,,!And@@Cases[FactorInteger[n],{p_,k_}:>!aQ[PrimePi[p]]]];
Select[Range[200],aQ]

A092875 Aronson transform of the "evil" sequence (A001969).

Original entry on oeis.org

2, 3, 5, 7, 9, 11, 12, 13, 15, 16, 17, 18, 20, 21, 23, 24, 27, 29, 31, 33, 34, 35, 36, 39, 41, 42, 43, 44, 45, 47, 48, 49, 51, 53, 54, 57, 59, 61, 63, 64, 65, 66, 68, 71, 72, 73, 75, 77, 78, 79, 80, 81, 83, 85, 87, 88, 89, 91, 92, 93, 95, 97, 99, 101, 102, 105, 107, 108, 109
Offset: 1

Views

Author

Ferenc Adorjan (fadorjan(AT)freemail.hu)

Keywords

Comments

b(n) positive monotonic sequence is the Aronson transform of a(n) positive monotonic sequence if every member of a(n) satisfies the condition: "k is in b if and only if b(k) is in a", so that k must be the least such number.

Links

Crossrefs

Cf. A079254, A079257, A079258, A080760.

Programs

  • PARI
    {arons(v)= /* Returns the Aronson transform of v */ local(x=[],pv=1,px=1,n=1,i=0,k,l); l=matsize(v)[2];
/*The initial terms: */ if(n0 if (i+1) is in v */ if(k==i,n+=1;if(pv<0,pv=abs(pv);while(pv>0,n+=1;pv=isin (n,v,l,pv))), px=isin(i+1,x,i,px);if(px>0,pv=-abs(pv);while (pv<0,n+=1;pv=isin(n,v,l,pv)), pv=abs(pv);while(pv>0,n+=1;pv=isin(n,v,l,pv)))); x=concat(x,n);i+=1);/*print(i);*/ return(x) }
{isin(x,v,l,poi)= /*If x integer is in v monotonic vector of length l, the function returns a positive 'poi', else a negative one. (poi is pointer, used for acceleration. The last returned value is recommended in the input) */
poi=abs(poi);if(poi==1&&x1,poi-=1);if(x<>v [poi],poi*=-1), if(x>v[poi], while(x>v[poi]&&poiv [poi],poi*=-1)));return(poi))}
Previous Showing 11-20 of 36 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.