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 51-60 of 62 results. Next

A376600 Inflection or undulation points in the sequence of non-prime-powers inclusive (A024619).

Original entry on oeis.org

2, 7, 9, 10, 11, 14, 15, 18, 20, 22, 24, 26, 29, 30, 31, 33, 39, 41, 43, 44, 45, 47, 48, 50, 51, 52, 55, 56, 57, 58, 59, 62, 64, 66, 68, 70, 73, 74, 75, 76, 77, 80, 86, 87, 88, 90, 92, 93, 94, 95, 96, 97, 98, 100, 102, 103, 104, 107, 108, 109, 112, 114, 116
Offset: 1

Views

Author

Gus Wiseman, Oct 05 2024

Keywords

Comments

These are points at which the second differences (A376599) are zero.
Inclusive means 1 is a prime-power but not a non-prime-power. For the exclusive version, add 1 to all terms.

Examples

			The non-prime-powers inclusive are (A024619):
  6, 10, 12, 14, 15, 18, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, ...
with first differences (A375735):
  4, 2, 2, 1, 3, 2, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, ...
with first differences (A376599):
  -2, 0, -1, 2, -1, -1, 0, 1, 0, 0, 0, 1, -2, 0, 0, 1, -1, 0, 1, 0, -1, 0, 1, 0, ...
with zeros at (A376600):
  2, 7, 9, 10, 11, 14, 15, 18, 20, 22, 24, 26, 29, 30, 31, 33, 39, 41, 43, 44, ...
		

Crossrefs

For first differences we had A375735, ones A375713(n)-1.
These are the zeros of A376599.
The complement is A376601.
A000961 lists prime-powers inclusive, exclusive A246655.
A001597 lists perfect-powers, complement A007916.
A024619/A361102 list non-prime-powers inclusive.
A321346/A321378 count integer partitions into non-prime-powers, factorizations A322452.
For non-prime-powers: A375735/A375708 (first differences), A376599 (second differences), A376601 (nonzero curvature).
For second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power).

Programs

  • Mathematica
    Join@@Position[Differences[Select[Range[100], !(#==1||PrimePowerQ[#])&],2],0]

A373200 Numbers k such that the k-th maximal antirun of squarefree numbers has length different from all prior maximal antiruns. Sorted positions of first appearances in A373127.

Original entry on oeis.org

1, 3, 8, 10, 19, 162, 1633, 1853, 2052, 26661, 46782, 1080330, 3138650
Offset: 1

Views

Author

Gus Wiseman, Jun 10 2024

Keywords

Comments

The unsorted version is A373128.
An antirun of a sequence (in this case A005117) is an interval of positions at which consecutive terms differ by more than one.

Examples

			The maximal antiruns of squarefree numbers begin:
   1
   2
   3   5
   6
   7  10
  11  13
  14
  15  17  19  21
  22
  23  26  29
  30
  31  33
  34
  35  37
The a(n)-th rows are:
    1
    3    5
   15   17   19   21
   23   26   29
   47   51   53   55   57
  483  485  487  489  491  493
		

Crossrefs

For squarefree runs we have the triple (1,3,5), firsts of A120992.
For prime runs we have the triple (1,2,3), firsts of A175632.
The unsorted version is A373128, firsts of A373127.
For nonsquarefree runs we have A373199 (assuming sorted), firsts of A053797.
For composite runs we have A373400, unsorted A073051.
For prime antiruns we have A373402, unsorted A373401, firsts of A027833.
For composite antiruns we have the triple (1,2,7), firsts of A373403.
A005117 lists the squarefree numbers, first differences A076259.
A013929 lists the nonsquarefree numbers, first differences A078147.

Programs

  • Mathematica
    t=Length/@Split[Select[Range[10000],SquareFreeQ],#1+1!=#2&]//Most;
    Select[Range[Length[t]],FreeQ[Take[t,#-1],t[[#]]]&]

A376561 Points of downward concavity in the sequence of perfect-powers (A001597).

Original entry on oeis.org

2, 5, 7, 13, 14, 18, 19, 21, 24, 25, 29, 30, 39, 40, 45, 51, 52, 56, 59, 66, 70, 71, 74, 87, 94, 101, 102, 108, 110, 112, 113, 119, 127, 135, 143, 144, 156, 157, 160, 161, 169, 178, 187, 196, 205, 206, 215, 224, 225, 234, 244, 263, 273, 283, 284, 293, 294, 304
Offset: 1

Views

Author

Gus Wiseman, Sep 30 2024

Keywords

Comments

These are points at which the second differences are negative.
Perfect-powers (A001597) are numbers with a proper integer root.
Note that, for some sources, downward concavity is positive curvature.
From Robert Israel, Oct 31 2024: (Start)
The first case of two consecutive numbers in the sequence is a(4) = 13 and a(5) = 14.
The first case of three consecutive numbers is a(293) = 2735, a(294) = 2736, a(295) = 2737.
The first case of four consecutive numbers, if it exists, involves a(k) with k > 69755. (End)

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, 33, ...
with first differences (A376559):
  1, -3, 6, 2, -7, 3, -1, 9, 2, 2, 2, 2, -17, -1, 13, 9, 2, -7, -11, 9, -5, 20, 2, ...
with negative positions (A376561):
  2, 5, 7, 13, 14, 18, 19, 21, 24, 25, 29, 30, 39, 40, 45, 51, 52, 56, 59, 66, 70, ...
		

Crossrefs

The version for A000002 is A025505, complement A022297. See also A054354, A376604.
For first differences we have A053289, union A023055, firsts A376268, A376519.
For primes instead of perfect-powers we have A258026.
For upward concavity we have A376560 (probably the complement).
A000961 lists the prime-powers inclusive, exclusive A246655.
A001597 lists the perfect-powers.
A007916 lists the non-perfect-powers.
A112344 counts partitions into perfect-powers, factorizations A294068.
A333254 gives run-lengths of differences between consecutive primes.
Second differences: A036263 (prime), A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376590 (squarefree), A376593 (nonsquarefree), A376596 (prime-power), A376599 (non-prime-power).

Programs

  • Maple
    N:= 10^6: # to use perfect powers <= N
    P:= {seq(seq(i^m,i=2..floor(N^(1/m))), m=2 .. ilog2(N))}: nP:= nops(P):
    P:= sort(convert(P,list)):
    select(i -> 2*P[i] > P[i-1]+P[i+1], [$2..nP-1]); # Robert Israel, Oct 31 2024
  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
    Join@@Position[Sign[Differences[Select[Range[1000],perpowQ],2]],-1]

A376588 Inflection and undulation points in the sequence of non-perfect-powers (A007916).

Original entry on oeis.org

3, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 19, 21, 22, 25, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84
Offset: 1

Views

Author

Gus Wiseman, Oct 03 2024

Keywords

Comments

These are points at which the second differences (A376562) are zero.
Non-perfect-powers (A007916) are numbers without a proper integer root.

Examples

			The non-perfect powers (A007916) are:
  2, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 26, 28, ...
with first differences (A375706):
  1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, ...
with first differences (A376562):
  1, -1, 0, 2, -2, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 1, -1, 0, ...
with zeros at (A376588):
  3, 6, 7, 8, 9, 12, 13, 14, 15, 16, 17, 19, 21, 22, 25, 28, 29, 30, 31, 32, 33, ...
		

Crossrefs

The version for A000002 is empty.
For first differences we had A375706, ones A375740, complement A375714.
Positions of zeros in A376562, complement A376589.
Runs of non-perfect-powers:
- length: A375702 = A053289(n+1) - 1
- first: A375703 (same as A216765 with 2 exceptions)
- last: A375704 (same as A045542 with 8 removed)
- sum: A375705
A000961 lists prime-powers inclusive, exclusive A246655.
A007916 lists non-perfect-powers, complement A001597.
A305631 counts integer partitions into non-perfect-powers, factorizations A322452.
A333254 gives run-lengths of differences between consecutive primes.
For non-perfect-powers: A375706 (first differences), A376562 (second differences), A376589 (nonzero curvature).
For second differences: A064113 (prime), A376602 (composite), {} (perfect-power), A376591 (squarefree), A376594 (nonsquarefree), A376597 (prime-power inclusive), A376600 (non-prime-power inclusive).

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Join@@Position[Differences[Select[Range[100],radQ],2],0]

A376589 Points of nonzero curvature in the sequence of non-perfect-powers (A007916).

Original entry on oeis.org

1, 2, 4, 5, 10, 11, 18, 20, 23, 24, 26, 27, 38, 39, 52, 53, 68, 69, 86, 87, 106, 107, 109, 110, 111, 112, 126, 127, 150, 151, 176, 177, 195, 196, 203, 204, 220, 221, 232, 233, 264, 265, 298, 299, 316, 317, 333, 334, 371, 372, 411, 412, 453, 454, 480, 481, 496
Offset: 1

Views

Author

Gus Wiseman, Oct 03 2024

Keywords

Comments

These are points at which the second differences (A376562) are nonzero.
Non-perfect-powers (A007916) are numbers without a proper integer root.

Examples

			The non-perfect powers (A007916) are:
  2, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 23, 24, 26, 28, ...
with first differences (A375706):
  1, 2, 1, 1, 3, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, ...
with first differences (A376562):
  1, -1, 0, 2, -2, 0, 0, 0, 0, 1, -1, 0, 0, 0, 0, 0, 0, 1, 0, -1, 0, 0, 1, -1, 0, ...
with nonzeros at (A376589):
  1, 2, 4, 5, 10, 11, 18, 20, 23, 24, 26, 27, 38, 39, 52, 53, 68, 69, 86, 87, ...
		

Crossrefs

For first differences we had A375706, ones A375740, complement A375714.
These are the positions of nonzeros in A376562, complement A376588.
Runs of non-perfect-powers:
- length: A375702 = A053289(n+1) - 1
- first: A375703 (same as A216765 with 2 exceptions)
- last: A375704 (same as A045542 with 8 removed)
- sum: A375705
A000961 lists prime-powers inclusive, exclusive A246655.
A007916 lists non-perfect-powers, complement A001597.
A305631 counts integer partitions into non-perfect-powers, factorizations A322452.
For non-perfect-powers: A375706 (first differences), A376562 (second differences), A376588 (inflection and undulation points).
For second differences: A064113 (prime), A376602 (composite), A376591 (squarefree), A376594 (nonsquarefree), A376597 (prime-power), A376600 (non-prime-power).

Programs

  • Mathematica
    radQ[n_]:=n>1&&GCD@@Last/@FactorInteger[n]==1;
    Join@@Position[Sign[Differences[Select[Range[1000],radQ],2]],1|-1]

A376601 Points of nonzero curvature in the sequence of non-prime-powers inclusive (A024619).

Original entry on oeis.org

1, 3, 4, 5, 6, 8, 12, 13, 16, 17, 19, 21, 23, 25, 27, 28, 32, 34, 35, 36, 37, 38, 40, 42, 46, 49, 53, 54, 60, 61, 63, 65, 67, 69, 71, 72, 78, 79, 81, 82, 83, 84, 85, 89, 91, 99, 101, 105, 106, 110, 111, 113, 115, 117, 118, 122, 124, 132, 134, 136, 138, 148
Offset: 1

Views

Author

Gus Wiseman, Oct 05 2024

Keywords

Comments

These are points at which the second differences (A376599) are nonzero.
Inclusive means 1 is a prime-power but not a non-prime-power. For the exclusive version, subtract 1 and shift left.

Examples

			The non-prime-powers inclusive (A024619) are:
  6, 10, 12, 14, 15, 18, 20, 21, 22, 24, 26, 28, 30, 33, 34, 35, 36, 38, 39, 40, ...
with first differences (A375735):
  4, 2, 2, 1, 3, 2, 1, 1, 2, 2, 2, 2, 3, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, ...
with first differences (A376599):
  -2, 0, -1, 2, -1, -1, 0, 1, 0, 0, 0, 1, -2, 0, 0, 1, -1, 0, 1, 0, -1, 0, 1, 0, ...
with nonzero terms (A376601) at:
  1, 3, 4, 5, 6, 8, 12, 13, 16, 17, 19, 21, 23, 25, 27, 28, 32, 34, 35, 36, 37, ...
		

Crossrefs

For first differences we had A375735, ones A375713(n) - 1.
These are the nonzeros of A376599.
The complement is A376600.
A000961 lists prime-powers inclusive, exclusive A246655.
A007916 lists non-perfect-powers.
A024619/A361102 list non-prime-powers inclusive.
A057820 gives first differences of prime-powers inclusive.
A321346/A321378 count integer partitions into non-prime-powers, factorizations A322452.
For non-prime-powers: A375735/A375708 (first differences), A376599 (second differences), A376600 (inflections and undulations).
For nonzero curvature: A333214 (prime), A376603 (composite), A376588 (non-perfect-power), A376592 (squarefree), A376595 (nonsquarefree), A376598 (prime-power).

Programs

  • Mathematica
    Join@@Position[Sign[Differences[Select[Range[100], !(#==1||PrimePowerQ[#])&],2]],1|-1]

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[[#]]]&]

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.

A377043 The n-th perfect-power A001597(n) minus the n-th power of a prime A000961(n).

Original entry on oeis.org

0, 2, 5, 5, 11, 18, 19, 23, 25, 36, 48, 64, 81, 98, 100, 101, 115, 138, 164, 179, 184, 200, 209, 240, 271, 284, 300, 336, 374, 413, 439, 450, 495, 542, 587, 632, 683, 738, 793, 852, 887, 903, 964, 1029, 1097, 1165, 1194, 1230, 1295, 1370, 1443, 1518, 1561
Offset: 1

Views

Author

Gus Wiseman, Oct 25 2024

Keywords

Comments

Perfect-powers (A001597) are numbers with a proper integer root.

Crossrefs

Excluding 1 from the powers of primes gives A377044.
A000015 gives the least prime-power >= n.
A031218 gives the greatest prime-power <= n.
A000040 lists the primes, differences A001223.
A000961 lists the powers of primes, differences A057820.
A001597 lists the perfect-powers, differences A053289, seconds A376559.
A007916 lists the non-perfect-powers, differences A375706, seconds A376562.
A024619 lists the non-prime-powers, differences A375735, seconds A376599.
A025475 lists numbers that are both a perfect-power and a prime-power.
A080101 counts prime-powers between primes (exclusive).
A106543 lists numbers that are neither a perfect-power nor a prime-power.
A131605 lists perfect-powers that are not prime-powers.
A246655 lists the prime-powers, complement A361102 (differences A375708).
Prime-power runs: A373675, min A373673, max A373674, length A174965.
Prime-power antiruns: A373576, min A120430, max A006549, length A373671.

Programs

  • Mathematica
    perpowQ[n_]:=n==1||GCD@@FactorInteger[n][[All,2]]>1;
    per=Select[Range[1000],perpowQ];
    per-NestList[NestWhile[#+1&,#+1,!PrimePowerQ[#]&]&,1,Length[per]-1]
  • Python
    from sympy import mobius, primepi, integer_nthroot
    def A377043(n):
        def bisection(f,kmin=0,kmax=1):
            while f(kmax) > kmax: kmax <<= 1
            while kmax-kmin > 1:
                kmid = kmax+kmin>>1
                if f(kmid) <= kmid:
                    kmax = kmid
                else:
                    kmin = kmid
            return kmax
        def f(x): return int(n-1+x+sum(mobius(k)*(integer_nthroot(x,k)[0]-1) for k in range(2,x.bit_length())))
        def g(x): return int(n-1+x-sum(primepi(integer_nthroot(x,k)[0]) for k in range(1,x.bit_length())))
        return bisection(f,n,n)-bisection(g,n,n) # Chai Wah Wu, Oct 27 2024

Formula

a(n) = A001597(n) - A000961(n).
Previous Showing 51-60 of 62 results. Next