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

A379300 Number of prime indices of n that are composite.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 0, 1, 1, 0, 2, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 0, 0, 1, 0, 1, 1
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 39 are {2,6}, so a(39) = 1.
The prime indices of 70 are {1,3,4}, so a(70) = 1.
The prime indices of 98 are {1,4,4}, so a(98) = 2.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 3.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Crossrefs

Positions of first appearances are A000420.
Positions of zero are A302540, counted by A034891 (strict A036497).
Positions of one are A379301, 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.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A000586, A000607, A076610, A331386, A331915, A379304, A379305.
- 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.
Cf. A023895, A113646, A175804, A204389, A320629, A376680, A378373, A378456.

Programs

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

Formula

Totally additive with a(prime(k)) = A066247(k).

A379311 Number of prime indices of n that are 1 or prime.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 0, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 1, 3, 2, 0, 3, 1, 5, 2, 2, 1, 4, 0, 1, 1, 4, 1, 2, 0, 3, 3, 1, 0, 5, 0, 3, 2, 2, 0, 4, 2, 3, 1, 1, 1, 4, 0, 2, 2, 6, 1, 3, 1, 3, 1, 2, 0, 5, 0, 1, 3, 2, 1, 2, 0, 5, 4, 2, 1, 3, 2, 1, 1
Offset: 1

Views

Author

Gus Wiseman, Dec 27 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 39 are {2,6}, so a(39) = 1.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 1.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 2.

Crossrefs

Positions of first appearances are A000079.
These "old" primes are listed by A008578.
Positions of zero are A320629, counted by A023895 (strict A204389).
Positions of one are A379312, counted by A379314 (strict A379315).
Positions of nonzero terms are A379313.
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, A173390, A376683, A376855.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A000586, A000607, A076610, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A002095, A096258, A320628, A330945.
- A379306 squarefree, see A302478, A379308, A379309, A379316.
- A379310 nonsquarefree, see A114374, A256012, A379307.
Cf. A034891, A036234, A036497, A038550, A087436, A302540, A379300, A379301.

Programs

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

Formula

Totally additive with a(prime(k)) = A080339(k).

A379307 Positive integers whose prime indices include no squarefree numbers.

Original entry on oeis.org

1, 7, 19, 23, 37, 49, 53, 61, 71, 89, 97, 103, 107, 131, 133, 151, 161, 173, 193, 197, 223, 227, 229, 239, 251, 259, 263, 281, 307, 311, 337, 343, 359, 361, 371, 379, 383, 409, 419, 427, 433, 437, 457, 463, 479, 497, 503, 521, 523, 529, 541, 569, 593, 613, 623
Offset: 1

Views

Author

Gus Wiseman, Dec 27 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:
    1: {}
    7: {4}
   19: {8}
   23: {9}
   37: {12}
   49: {4,4}
   53: {16}
   61: {18}
   71: {20}
   89: {24}
   97: {25}
  103: {27}
  107: {28}
  131: {32}
  133: {4,8}
  151: {36}
  161: {4,9}
  173: {40}

Crossrefs

Partitions of this type are counted by A114374, strict A256012.
Positions of zero in A379306.
For a unique squarefree part we have A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A038550, A057627, A068361, A070321, A071403, A072284, A087436, A112929, A377430, A378086.

Programs

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

A379310 Number of nonsquarefree prime indices of n.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 2, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0
Offset: 1

Views

Author

Gus Wiseman, Dec 27 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 39 are {2,6}, so a(39) = 0.
The prime indices of 70 are {1,3,4}, so a(70) = 1.
The prime indices of 98 are {1,4,4}, so a(98) = 2.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 2.

Crossrefs

Positions of first appearances are A000420.
Positions of zero are A302478, counted by A073576 (strict A087188).
No squarefree parts: A379307, counted by A114374 (strict A256012).
One squarefree part: A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A038550, A057627, A068361, A070321, A071403, A087436, A112929, A120327, A378086.

Programs

  • Mathematica
    prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
Table[Length[Select[prix[n],Not@*SquareFreeQ]],{n,100}]

Formula

Totally additive with a(prime(k)) = A107078(k) = 1 - A008966(k).

A131651 Positive integers obtained as the difference of two triangular numbers in exactly 4 ways.

Original entry on oeis.org

15, 21, 27, 30, 33, 35, 39, 42, 51, 54, 55, 57, 60, 65, 66, 69, 70, 77, 78, 84, 85, 87, 91, 93, 95, 102, 108, 110, 111, 114, 115, 119, 120, 123, 125, 129, 130, 132, 133, 138, 140, 141, 143, 145, 154, 155, 156, 159, 161, 168, 170, 174, 177, 182, 183, 185, 186, 187
Offset: 1

Views

Author

John W. Layman, Sep 10 2007

Keywords

Comments

It appears that terms of the sequence are all given by a power of 2 times the cube of an odd prime or a power of 2 times a product of two distinct odd primes. (This has been verified for a(n) <= 10000.)
Apparently the integers that have exactly 4 odd divisors. (Verified for a(n) <= 187.) - Philippe Beaudoin, Oct 24 2013
Also numbers that can be expressed as the sum of k > 1 consecutive positive integers in exactly 3 ways; e.g., 7+8 = 15, 4+5+6 = 15 and 1+2+3+4+5 = 15. - Julie Jones, Aug 13 2018

Examples

			15 is in the sequence because 15 = 15 - 0 = 21 - 6 = 36 - 21 = 120 - 105, where all operands are triangular, and in no other way.

Links

Crossrefs

Cf. A001227, A038550, A072502, A285800.

Programs

  • PARI
    isok(n) = {v = vector(n, i, i*(i+1)/2); nb = 0; for (i=1, n, if (ispolygonal(i*(i+1)/2 - n, 3), nb++; if (nb > 4, return (0)););); nb == 4;} \\ Michel Marcus, Jan 14 2014

A379306 Number of squarefree prime indices of n.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 0, 3, 2, 2, 1, 3, 1, 1, 2, 4, 1, 3, 0, 3, 1, 2, 0, 4, 2, 2, 3, 2, 1, 3, 1, 5, 2, 2, 1, 4, 0, 1, 2, 4, 1, 2, 1, 3, 3, 1, 1, 5, 0, 3, 2, 3, 0, 4, 2, 3, 1, 2, 1, 4, 0, 2, 2, 6, 2, 3, 1, 3, 1, 2, 0, 5, 1, 1, 3, 2, 1, 3, 1, 5, 4, 2, 1, 3, 2, 2, 2
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 39 are {2,6}, so a(39) = 2.
The prime indices of 70 are {1,3,4}, so a(70) = 2.
The prime indices of 98 are {1,4,4}, so a(98) = 1.
The prime indices of 294 are {1,2,4,4}, a(294) = 2.
The prime indices of 1911 are {2,4,4,6}, so a(1911) = 2.
The prime indices of 2548 are {1,1,4,4,6}, so a(2548) = 3.

Crossrefs

Positions of first appearances are A000079.
Positions of zero are A379307, counted by A114374 (strict A256012).
Positions of one are A379316, counted by A379308 (strict A379309).
A000040 lists the primes, differences A001223.
A005117 lists the squarefree numbers, differences A076259.
A008966 is the characteristic function for the squarefree numbers.
A013929 lists the nonsquarefree numbers, differences A078147.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
A061398 counts squarefree numbers between primes, zeros A068360.
A377038 gives k-th differences of squarefree numbers.
Other counts of prime indices:
- A087436 postpositive, see A038550.
- A257991 odd, see A000041, A000070, A066207, A349158.
- A257992 even, see A000009, A038348, A066208, A379317.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379310 nonsquarefree, see A302478.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A013928, A057627, A068361, A070321, A071403, A072284, A112925, A112929, A120327, A377430, A378086.

Programs

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

Formula

Totally additive with a(prime(k)) = A008966(k).

A379317 Positive integers with a unique even prime index.

Original entry on oeis.org

3, 6, 7, 12, 13, 14, 15, 19, 24, 26, 28, 29, 30, 33, 35, 37, 38, 43, 48, 51, 52, 53, 56, 58, 60, 61, 65, 66, 69, 70, 71, 74, 75, 76, 77, 79, 86, 89, 93, 95, 96, 101, 102, 104, 106, 107, 112, 113, 116, 119, 120, 122, 123, 130, 131, 132, 138, 139, 140, 141, 142
Offset: 1

Views

Author

Gus Wiseman, Dec 29 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:
   3: {2}
   6: {1,2}
   7: {4}
  12: {1,1,2}
  13: {6}
  14: {1,4}
  15: {2,3}
  19: {8}
  24: {1,1,1,2}
  26: {1,6}
  28: {1,1,4}
  29: {10}
  30: {1,2,3}
  33: {2,5}
  35: {3,4}
  37: {12}
  38: {1,8}
  43: {14}
  48: {1,1,1,1,2}

Crossrefs

Partitions of this type are counted by A038348 (strict A096911).
For all even parts we have A066207, counted by A035363 (strict A000700).
For no even parts we have A066208, counted by A000009 (strict A035457).
Positions of 1 in A257992.
A000040 lists the primes, differences A001223.
A055396 gives least prime index, greatest A061395.
A056239 adds up prime indices, row sums of A112798, counted by A001222.
Other counts of prime indices:
- A257991 odd, see A000041, A000070, A349158.
- A257994 prime, see A002095, A096258, A320628, A331386, A331915, A379304, A379305.
- A330944 nonprime, see A000586, A000607, A076610, A330945.
- A379300 composite, see A023895, A034891, A036497, A302540, A379301.
- A379311 old prime, see A204389, A320629, A379312-A379315.
Cf. A000720, A038550, A087436.

Programs

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

A100368 Numbers of the form 2^k * p where k > 0 and p is an odd prime.

Original entry on oeis.org

6, 10, 12, 14, 20, 22, 24, 26, 28, 34, 38, 40, 44, 46, 48, 52, 56, 58, 62, 68, 74, 76, 80, 82, 86, 88, 92, 94, 96, 104, 106, 112, 116, 118, 122, 124, 134, 136, 142, 146, 148, 152, 158, 160, 164, 166, 172, 176, 178, 184, 188, 192, 194, 202, 206, 208, 212, 214, 218, 224
Offset: 1

Views

Author

Labos Elemer, Nov 22 2004

Keywords

Comments

Even numbers with 2 distinct prime factors where the odd factor is prime.
A proper subset of A098202. E.g., 210 is not here, but it is there. Also differs from A100367: 36, 100, 108, 196, etc. are missing here. Different also from A036348 because 90 and 180 are not here.
A128691 is a subsequence; A078834(a(n)) = A006530(a(n)). - Reinhard Zumkeller, Sep 19 2011
Composite numbers k having the property that the number of divisors of 2k equals the number of divisors of k + 2. All primes satisfy this property. - Gary Detlefs, Jan 23 2019

Links

Crossrefs

Cf. A001221, A038550, A098902, A100367, A036348, A100484.

Programs

  • GAP
    a:=Filtered([1..224],n->Tau(2*n)=Tau(n)+2 and not IsPrime(n));; Print(a); # Muniru A Asiru, Jan 22 2019
  • Haskell
    import Data.Set (singleton, deleteFindMin, insert)
a100368 n = a100368_list !! (n-1)
a100368_list = f (singleton 6) (tail a065091_list) where
f s ps'@(p:ps) | mod m 4 > 0 = m : f (insert (2*p) $ insert (2*m) s') ps
| otherwise = m : f (insert (2*m) s') ps'
where (m,s') = deleteFindMin s
-- Reinhard Zumkeller, Sep 19 2011
  • Maple
    N:= 1000: # to get all terms <= N
P:= select(isprime, [seq(i,i=3..N/2,2)]):
S:= {seq(seq(2^i*p,i=1..ilog2(N/p)),p=P)}:
sort(convert(S,list)); # Robert Israel, Jul 09 2017
with(numtheory): for n from 1 to 224 do if tau(2*n)=tau(n)+2 and not isprime(n) then print(n) fi od # Gary Detlefs, Jan 22 2019
  • Mathematica
    <Harvey P. Dale, Sep 03 2016 *)
  • PARI
    is(n)=n%2==0 && isprime(n>>valuation(n,2)) \\ Charles R Greathouse IV, Jul 09 2017
  • PARI
    list(lim)=my(v=List()); for(k=1,logint(lim\3,2), forprime(p=3,lim>>k, listput(v,p<Charles R Greathouse IV, Jul 09 2017

Formula

Numbers of the form 2^k*p where k > 0, p is an odd prime.
a(n) = 2*A038550(n). - Amiram Eldar, Dec 21 2020

Extensions

Name edited by Charles R Greathouse IV, Jul 09 2017

A230577 Positive integers that have exactly 6 odd divisors.

Original entry on oeis.org

45, 63, 75, 90, 99, 117, 126, 147, 150, 153, 171, 175, 180, 198, 207, 234, 243, 245, 252, 261, 275, 279, 294, 300, 306, 325, 333, 342, 350, 360, 363, 369, 387, 396, 414, 423, 425, 468, 475, 477, 486, 490
Offset: 1

Views

Author

Philippe Beaudoin, Oct 23 2013

Keywords

Comments

Numbers that can be formed in exactly 5 ways by summing sequences of 2 or more consecutive integers.
Column 6 of A266531. - Omar E. Pol, Apr 03 2016
Numbers n such that the symmetric representation of sigma(n) has 6 subparts. - Omar E. Pol, Dec 28 2016

Links

Crossrefs

Cf. A000203, A001227, A077646, A237593, A279387, A266531.
Numbers with k odd divisors (k = 1..10): A000079, A038550, A072502, apparently A131651, A267696, this sequence, A267697, A267891, A267892, A267893.

Programs

A267696 Numbers with 5 odd divisors.

Original entry on oeis.org

81, 162, 324, 625, 648, 1250, 1296, 2401, 2500, 2592, 4802, 5000, 5184, 9604, 10000, 10368, 14641, 19208, 20000, 20736, 28561, 29282, 38416, 40000, 41472, 57122, 58564, 76832, 80000, 82944, 83521, 114244, 117128, 130321, 153664, 160000, 165888, 167042, 228488, 234256, 260642, 279841
Offset: 1

Views

Author

Omar E. Pol, Apr 03 2016

Keywords

Comments

Positive integers that have exactly five odd divisors.
Numbers k such that the symmetric representation of sigma(k) has 5 subparts. - Omar E. Pol, Dec 28 2016
Also numbers that can be expressed as the sum of k > 1 consecutive positive integers in exactly 4 ways; e.g., 81 = 40+41 = 26+27+28 = 11+12+13+14+15+16 = 5+6+7+8+9+10+11+12+13. - Julie Jones, Aug 13 2018

Links

Crossrefs

Column 5 of A266531.
Cf. A001227, A030514, A038547, A085964, A236104, A237593, A279387.
Numbers with k odd divisors (k = 1..10): A000079, A038550, A072502, apparently A131651, this sequence, A230577, A267697, A267891, A267892, A267893.

Programs

  • GAP
    A:=List([1..700000],n->DivisorsInt(n));;
B:=List([1..Length(A)],i->Filtered(A[i],IsOddInt));;
a:=Filtered([1..Length(B)],i->Length(B[i])=5); # Muniru A Asiru, Aug 14 2018
  • PARI
    isok(n) = sumdiv(n, d, (d%2)) == 5; \\ Michel Marcus, Apr 03 2016

Formula

A001227(a(n)) = 5.
Sum_{n>=1} 1/a(n) = 2 * P(4) - 1/8 = 0.00289017370127..., where P(4) is the value of the prime zeta function at 4 (A085964). - Amiram Eldar, Sep 16 2024

Extensions

More terms from Michel Marcus, Apr 03 2016
Previous Showing 11-20 of 41 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.