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

A376268 Sorted positions of first appearances in the first differences (A053289) of perfect-powers (A001597).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19, 21, 23, 24, 27, 28, 29, 30, 32, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 47, 48, 49, 50, 51, 53, 54, 55, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 67, 69, 70, 71, 72, 73, 74, 76, 77, 78, 79, 80, 81
Offset: 1

Views

Author

Gus Wiseman, Sep 28 2024

Keywords

Examples

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, ...
with positions of first appearances (A376268):
  1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 16, 17, 18, 19, 21, 23, 24, 27, 28, 29, ...
		

Crossrefs

These are the sorted positions of first appearances in A053289 (union A023055).
The complement is A376519.
A053707 lists first differences of consecutive prime-powers.
A333254 lists run-lengths of differences between consecutive primes.
Other families of numbers and their first differences:
For prime numbers (A000040) we have A001223.
For composite numbers (A002808) we have A073783.
For nonprime numbers (A018252) we have A065310.
For perfect powers (A001597) we have A053289.
For non-perfect-powers (A007916) we have A375706.
For squarefree numbers (A005117) we have A076259.
For nonsquarefree numbers (A013929) we have A078147.
For prime-powers inclusive (A000961) we have A057820.
For prime-powers exclusive (A246655) we have A057820(>1).
For non-prime-powers inclusive (A024619) we have A375735.
For non-prime-powers exclusive (A361102) we have A375708.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
    q=Differences[Select[Range[1000],perpowQ]];
    Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A376519 Positions of terms not appearing for the first time in the first differences (A053289) of perfect-powers (A001597).

Original entry on oeis.org

8, 14, 15, 20, 22, 25, 26, 31, 40, 46, 52, 59, 68, 75, 88, 96, 102, 110, 111, 112, 114, 128, 136, 144, 145, 162, 180, 188, 198, 216, 226, 235, 246, 264, 265, 275, 285, 295, 305, 316, 317, 325, 328, 338, 350, 360, 367, 373, 385, 406, 416, 417, 419, 431, 443
Offset: 1

Views

Author

Gus Wiseman, Sep 28 2024

Keywords

Examples

			The perfect powers (A001597) are:
  1, 4, 8, 9, 16, 25, 27, 32, 36, 49, 64, 81, 100, 121, 125, 128, 144, 169, 196, ...
with first differences (A053289):
  3, 4, 1, 7, 9, 2, 5, 4, 13, 15, 17, 19, 21, 4, 3, 16, 25, 27, 20, 9, 18, 13, ...
with positions of latter appearances (A376519):
  8, 14, 15, 20, 22, 25, 26, 31, 40, 46, 52, 59, 68, 75, 88, 96, 102, 110, 111, ...
		

Crossrefs

These are the sorted positions of latter appearances in A053289 (union A023055).
The complement is A376268.
A053707 lists first differences of consecutive prime-powers.
A333254 lists run-lengths of differences between consecutive primes.
Other families of numbers and their first differences:
For prime numbers (A000040) we have A001223.
For composite numbers (A002808) we have A073783.
For nonprime numbers (A018252) we have A065310.
For perfect powers (A001597) we have A053289.
For non-perfect-powers (A007916) we have A375706.
For squarefree numbers (A005117) we have A076259.
For nonsquarefree numbers (A013929) we have A078147.
For prime-powers inclusive (A000961) we have A057820.
For prime-powers exclusive (A246655) we have A057820(>1).
For non-prime-powers inclusive (A024619) we have A375735.
For non-prime-powers exclusive (A361102) we have A375708.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
    q=Differences[Select[Range[1000],perpowQ]];
    Select[Range[Length[q]],MemberQ[Take[q,#-1],q[[#]]]&]

A073784 Number of primes between successive composite numbers.

Original entry on oeis.org

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

Views

Author

Lior Manor, Aug 11 2002

Keywords

Examples

			a(7) = 0 since there are no primes between the 7th and the 8th composites (14 and 15).
		

Crossrefs

a(n) = A073783(n) - 1.
a(n) = A002808(n+1) - A002808(n) - 1.
Also first differences of A073425.

Programs

  • Mathematica
    Composite[n_Integer] := FixedPoint[n + PrimePi[ # ] + 1 &, n + PrimePi[n] + 1]; Table[ PrimePi[Composite[n + 1]] - PrimePi[Composite[n]], {n, 105}] (* Robert G. Wilson v, Dec 20 2004 *)
    Differences[Select[Range[300],CompositeQ]]-1 (* Requires Mathematica version 10 or later *) (* Harvey P. Dale, Apr 01 2021 *)

A179621 a(n) = A179620(n)/A130882(n) unless A130882(n) = 0 in which case a(n) = 0.

Original entry on oeis.org

0, 1, 1, 4, 2, 2, 1, 7, 2, 4, 1, 10, 5, 1, 12, 5, 13, 2, 7, 1, 16, 11, 17, 2, 1, 19, 2, 10, 1, 22, 11, 1, 24, 7, 25, 10, 1, 27, 11, 28, 14, 2, 1, 31, 21, 32, 16, 1, 34, 17, 14, 1, 37, 25, 38, 19, 1, 40, 20, 1, 42, 17, 43, 2, 1, 45, 13, 46, 31, 47, 2, 1, 49, 14, 25, 1, 52, 26, 2, 1
Offset: 1

Views

Author

Rémi Eismann, Jan 09 2011

Keywords

Comments

a(n) is the "level" of composite numbers.
The decomposition of composite numbers into weight * level + gap is A002808(n) = A130882(n) * a(n) + A073783(n) if a(n) > 0.
A179620(n) = A002808(n) - A073783(n) if A002808(n) - A073783(n) > A073783(n), 0 otherwise.

Examples

			For n = 1 we have A130882(1) = 0, hence a(1) = 0.
For n = 3 we have A179620(3)/A130882(3)= 7 / 7 = 1; hence a(3) = 1.
For n = 24 we have A179620(24)/A130882(24)= 34 / 17 = 2; hence a(24) = 2.
		

Crossrefs

A091243 Differences between consecutive reducible GF(2)[X]-polynomials.

Original entry on oeis.org

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

Views

Author

Antti Karttunen, Jan 03 2004

Keywords

Comments

Analogous to A073783.

Crossrefs

First differences of A091242. a(n) = A091244(n)+1.

A136527 Triangle read by rows: T(n,k) = greatest common divisor of n-th and k-th composite number, 1<=k<=n.

Original entry on oeis.org

4, 2, 6, 4, 2, 8, 1, 3, 1, 9, 2, 2, 2, 1, 10, 4, 6, 4, 3, 2, 12, 2, 2, 2, 1, 2, 2, 14, 1, 3, 1, 3, 5, 3, 1, 15, 4, 2, 8, 1, 2, 4, 2, 1, 16, 2, 6, 2, 9, 2, 6, 2, 3, 2, 18, 4, 2, 4, 1, 10, 4, 2, 5, 4, 2, 20, 1, 3, 1, 3, 1, 3, 7, 3, 1, 3, 1, 21, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 22, 4, 6, 8, 3, 2, 12, 2, 3, 8, 6, 4, 3, 2, 24
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 03 2008

Keywords

Examples

			4;
2, 6;
4, 2, 8;
1, 3, 1, 9;
2, 2, 2, 1, 10;
...
		

Crossrefs

Programs

  • Mathematica
    nmax = 14;
    A002808 = Select[Range[FindRoot[n == nmax + PrimePi[n] + 1, {n, nmax, 2nmax}][[1, 2]] // Ceiling], CompositeQ];
    T[n_, k_] := GCD[A002808[[n]], A002808[[k]]];
    Table[T[n, k], {n, 1, nmax}, {k, 1, n}] // Flatten (* Jean-François Alcover, Nov 15 2021 *)

Formula

T(n,k) = A050873(A002808(n),A002808(k));
A073783(n) = T(n-1,n) for n>1;
A002808(n) = T(n,n).

A179620 a(n) = largest k such that A002808(n+1) = A002808(n) + (A002808(n) mod k), or 0 if no such k exists.

Original entry on oeis.org

0, 4, 7, 8, 8, 10, 13, 14, 14, 16, 19, 20, 20, 23, 24, 25, 26, 26, 28, 31, 32, 33, 34, 34, 37, 38, 38, 40, 43, 44, 44, 47, 48, 49, 50, 50, 53, 54, 55, 56, 56, 58, 61, 62, 63, 64, 64, 67, 68, 68, 70, 73, 74, 75, 76, 76, 79, 80, 80, 83, 84, 85, 86, 86, 89
Offset: 1

Views

Author

Rémi Eismann, Jan 09 2011

Keywords

Comments

a(n) = A002808(n) - A073783(n) if A002808(n) - A073783(n) > A073783(n), 0 otherwise.
A002808(n): composite numbers; A073783(n): first difference of composite numbers.

Examples

			For n = 1 we have A002808(n) = 4, A002808(n+1) = 6; there is no k such that 6 - 4 = 2 = (4 mod k), hence a(1) = 0.
For n = 3 we have A002808(n) = 8, A002808(n+1) = 9; 7 is the largest k such that 9 - 8 = 1 = (8 mod k), hence a(3) = 7; a(3) = A002808(3) - A073783(3) = 8 - 1 = 7.
For n = 24 we have A002808(n) = 36, A002808(n+1) = 38; 34 is the largest k such that 38 - 36 = 2 = (36 mod k), hence a(24) = 34; a(24) = A002808(24) - A073783(24) = 34.
		

Crossrefs

A375928 Positions of adjacent non-prime-powers (exclusive) differing by more than 1.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 10, 11, 12, 13, 14, 18, 21, 22, 25, 26, 29, 34, 35, 37, 39, 42, 43, 48, 49, 50, 55, 62, 65, 66, 69, 70, 73, 80, 83, 84, 86, 91, 92, 101, 102, 107, 112, 115, 116, 119, 124, 125, 134, 135, 138, 139, 150, 161, 164, 165, 168, 173, 174, 175, 182
Offset: 1

Views

Author

Gus Wiseman, Sep 12 2024

Keywords

Examples

			The non-prime-powers (exclusive) are 1, 6, 10, 12, 14, 15, 18, 20, ... which increase by more than 1 after positions 1, 2, 3, 4, 6, 7, ...
		

Crossrefs

For prime-powers inclusive (A000961) we have A376163, differences A373672.
For nonprime numbers (A002808) we have A014689, differences A046933.
First differences are A110969.
The complement is A375713.
For non-perfect-powers we have A375714, complement A375740.
The complement for prime-powers (exclusive) is A375734, differences A373671.
The complement for nonprime numbers is A375926, differences A373403.
A000040 lists the prime numbers, differences A001223.
A000961 lists prime-powers (inclusive), differences A057820.
A007916 lists non-perfect-powers, differences A375706.
A024619 lists non-prime-powers (inclusive), differences A375735.
A246655 lists prime-powers (exclusive), differences A174965.
A361102 lists non-prime-powers (exclusive), differences A375708.

Programs

  • Mathematica
    ce=Select[Range[100],!PrimePowerQ[#]&];
    Select[Range[Length[ce]-1],!ce[[#+1]]==ce[[#]]+1&]

Formula

The inclusive version is a(n+1) - 1.

A379313 Positive integers whose prime indices are not all composite.

Original entry on oeis.org

2, 3, 4, 5, 6, 8, 9, 10, 11, 12, 14, 15, 16, 17, 18, 20, 21, 22, 24, 25, 26, 27, 28, 30, 31, 32, 33, 34, 35, 36, 38, 39, 40, 41, 42, 44, 45, 46, 48, 50, 51, 52, 54, 55, 56, 57, 58, 59, 60, 62, 63, 64, 65, 66, 67, 68, 69, 70, 72, 74, 75, 76, 77, 78, 80, 81, 82
Offset: 1

Views

Author

Gus Wiseman, Dec 28 2024

Keywords

Comments

Or, positive integers whose prime indices include at least one 1 or prime number.
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}
     4: {1,1}
     5: {3}
     6: {1,2}
     8: {1,1,1}
     9: {2,2}
    10: {1,3}
    11: {5}
    12: {1,1,2}
    14: {1,4}
    15: {2,3}
    16: {1,1,1,1}
    17: {7}
    18: {1,2,2}
    20: {1,1,3}
    21: {2,4}
    22: {1,5}
    24: {1,1,1,2}
		

Crossrefs

Partitions of this type are counted by A000041 - A023895.
The "old" primes are listed by A008578.
For no composite parts we have A302540, counted by A034891 (strict A036497).
The complement is A320629, counted by A023895 (strict A204389).
For a unique prime we have A331915, counted by A379304 (strict A379305).
Positions of nonzeros in A379311.
For a unique 1 or prime we have A379312, 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.
A377033 gives k-th differences of composite numbers, see A073445, A377034.
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[100],!And@@CompositeQ/@prix[#]&]

A376163 Positions of adjacent non-prime-powers (inclusive, so 1 is a prime-power) differing by 1.

Original entry on oeis.org

4, 7, 8, 14, 15, 16, 18, 19, 22, 23, 26, 27, 29, 30, 31, 32, 35, 37, 39, 40, 43, 44, 45, 46, 50, 51, 52, 53, 55, 56, 57, 58, 59, 60, 62, 63, 66, 67, 70, 71, 73, 74, 75, 76, 77, 78, 80, 81, 84, 86, 87, 88, 89, 92, 93, 94, 95, 96, 97, 98, 99, 102, 103, 104, 105
Offset: 1

Views

Author

Gus Wiseman, Sep 13 2024

Keywords

Examples

			The non-prime-powers (inclusive) are 6, 10, 12, 14, 15, 18, 20, 21, 22, 24, ... which increase by 1 after positions 4, 7, 8, ...
		

Crossrefs

For prime-powers inclusive (A000961) we have A375734, differences A373671.
For nonprime numbers (A002808) we have A375926, differences A373403.
For prime-powers exclusive (A246655) we have A375734(n+1) + 1.
First differences are A373672.
The exclusive version is a(n) - 1 = A375713.
Positions of 1's in A375735.
For non-perfect-powers we have A375740.
Prime-powers inclusive:
- terms: A000961
- differences: A057820
Non-prime-powers inclusive:
- terms: A361102
- differences: A375708
A000040 lists all of the primes, differences A001223.
A007916 lists non-perfect-powers, differences A375706.

Programs

  • Mathematica
    ce=Select[Range[2,100],!PrimePowerQ[#]&];
    Select[Range[Length[ce]-1],ce[[#+1]]==ce[[#]]+1&]
Previous Showing 41-50 of 51 results. Next