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 21-27 of 27 results.

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, ...

Links

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).
Cf. A025475, A045542, A052410, A054819, A064113, A069623, A174965, A216765, A251092, A336416, A336417, A375702.

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]

A156242 Bisection of A054353.

Original entry on oeis.org

3, 6, 9, 12, 15, 19, 21, 24, 27, 30, 33, 36, 39, 42, 45, 47, 50, 54, 57, 60, 63, 66, 69, 72, 75, 77, 81, 84, 87, 90, 93, 96, 100, 102, 105, 108, 111, 114, 117, 120, 123, 127, 129, 132, 136, 139, 142, 145, 147, 151, 154, 156, 159, 163, 166, 169, 172, 174, 177, 181
Offset: 1

Views

Author

Benoit Cloitre, Feb 07 2009

Keywords

Comments

Positions of strict descents in the Kolakoski sequence A000002. Strict ascents are A156243. - Gus Wiseman, Mar 31 2020

Crossrefs

Cf. A000002, A156243.
The version for prime gaps is A258026.
Sizes of maximal weakly increasing subsequences of A000002 are A332875.
Cf. A054804, A124766, A124769, A225620, A238343, A332273, A333213, A333215, A333256, A333383.

Programs

  • Mathematica
    kolagrow[q_]:=If[Length[q]<2,Take[{1,2},Length[q]+1],Append[q,Switch[{q[[Length[Split[q]]]],q[[-2]],Last[q]},{1,1,1},0,{1,1,2},1,{1,2,1},2,{1,2,2},0,{2,1,1},2,{2,1,2},2,{2,2,1},1,{2,2,2},1]]]
kol[n_Integer]:=Nest[kolagrow,{1},n-1];
Join@@Position[Partition[kol[100],2,1],{2,1}] (* Gus Wiseman, Mar 31 2020 *)

Formula

a(n) = A054353(2n).
A000002(a(n))=2 and A000002(a(n)+1)=1. - Jon Perry, Sep 04 2012

A358531 Indices of the primes in A358530.

Original entry on oeis.org

6, 8, 11, 13, 14, 18, 20, 21, 23, 26, 27, 29, 32, 34, 36, 39, 42, 44, 46, 49, 50, 53, 55, 58, 60, 61, 64, 65, 68, 70, 74, 76, 79, 82, 84, 86, 89, 90, 93, 94, 96, 99, 101, 103, 105, 108, 110, 113, 114, 116, 117, 121, 123, 127, 129, 130, 132, 134, 135, 137
Offset: 1

Views

Author

Clark Kimberling, Nov 21 2022

Keywords

Comments

This sequence, together with A358529 and A356347, partition the set of positive integers >= 3.

Examples

			  n       1   2   3   4   5   6   7
  k       6   8  11  13  14  18  20
  p(n)   13  19  31  41  43  61  71

Crossrefs

Cf. A001223, A258026, A358528, A358529, A358530, A181424, A356347.

Programs

  • Mathematica
    t = Select[2 + Range[140],
Prime[#] - Prime[# - 1] < Prime[# - 1] - Prime[# - 2] &]  (* A358531 *)
Prime[t]  (* A358530 *)

Formula

a(n) = A258026(n) + 2.

A335277 First index of strictly increasing prime quartets.

Original entry on oeis.org

7, 13, 22, 28, 49, 60, 64, 69, 70, 75, 78, 85, 89, 95, 104, 116, 122, 123, 144, 148, 152, 155, 173, 178, 182, 195, 201, 206, 212, 215, 219, 225, 226, 230, 236, 237, 244, 253, 256, 257, 265, 288, 302, 307, 315, 325, 328, 329, 332, 333, 336, 348, 355, 361, 373
Offset: 1

Views

Author

Gus Wiseman, May 30 2020

Keywords

Comments

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) < g(k + 1) < g(k + 2).

Examples

			The first 10 strictly increasing prime quartets:
   17  19  23  29
   41  43  47  53
   79  83  89  97
  107 109 113 127
  227 229 233 239
  281 283 293 307
  311 313 317 331
  347 349 353 359
  349 353 359 367
  379 383 389 397
For example, 107 is the 28th prime, and the primes (107,109,113,127) have differences (2,4,14), which are strictly increasing, so 28 is in the sequence.

Crossrefs

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly decreasing prime quartets are A335278.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Lengths of maximal weakly decreasing sequences of prime gaps are A333212.
Lengths of maximal strictly increasing sequences of prime gaps are A333253.
Cf. A000040, A006560, A031217, A054800, A054819, A059044, A084758, A089180.

Programs

  • Mathematica
    ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-xPrimePi[x]]

Formula

prime(a(n)) = A054819(n).

A335278 First index of strictly decreasing prime quartets.

Original entry on oeis.org

11, 18, 24, 47, 58, 62, 87, 91, 111, 114, 127, 132, 146, 150, 157, 180, 210, 223, 228, 232, 242, 259, 260, 263, 269, 274, 275, 282, 283, 284, 299, 300, 309, 321, 344, 350, 351, 363, 364, 367, 368, 369, 375, 378, 382, 388, 393, 399, 406, 409, 413, 431, 442, 446
Offset: 1

Views

Author

Gus Wiseman, May 30 2020

Keywords

Comments

Let g(i) = prime(i + 1) - prime(i). These are numbers k such that g(k) > g(k + 1) > g(k + 2).

Examples

			The first 10 strictly decreasing prime quartets:
   31  37  41  43
   61  67  71  73
   89  97 101 103
  211 223 227 229
  271 277 281 283
  293 307 311 313
  449 457 461 463
  467 479 487 491
  607 613 617 619
  619 631 641 643
For example, 211 is the 47th prime, and the primes (211,223,227,229) have differences (12,4,2), which are strictly decreasing, so 47 is in the sequence.

Crossrefs

Prime gaps are A001223.
Second prime gaps are A036263.
Strictly increasing prime quartets are A335277.
Equal prime quartets are A090832.
Weakly increasing prime quartets are A333383.
Weakly decreasing prime quartets are A333488.
Unequal prime quartets are A333490.
Partially unequal prime quartets are A333491.
Positions of adjacent equal prime gaps are A064113.
Positions of strict ascents in prime gaps are A258025.
Positions of strict descents in prime gaps are A258026.
Positions of adjacent unequal prime gaps are A333214.
Positions of weak ascents in prime gaps are A333230.
Positions of weak descents in prime gaps are A333231.
Indices of strictly decreasing rows of A066099 are A333256.
Lengths of maximal weakly increasing sequences of prime gaps are A333215.
Lengths of maximal strictly decreasing sequences of prime gaps are A333252.
Cf. A000040, A006560, A031217, A054800, A054804, A059044, A084758, A089180, A333253.

Programs

  • Mathematica
    ReplaceList[Array[Prime,100],{_,x_,y_,z_,t_,_}/;y-x>z-y>t-z:>PrimePi[x]]

Formula

prime(a(n)) = A054804(n).

A376656 Sorted positions of first appearances in the second differences (A036263) of consecutive primes (A000040).

Original entry on oeis.org

1, 2, 3, 4, 9, 10, 29, 30, 33, 34, 96, 98, 99, 154, 179, 180, 189, 216, 217, 242, 262, 294, 296, 428, 429, 446, 708, 756, 834, 1005, 1182, 1229, 1663, 1830, 1831, 1846, 1879, 2191, 2224, 2343, 2809, 3077, 3086, 3384, 3385, 3427, 3643, 3644, 3793, 3795, 4230
Offset: 1

Views

Author

Gus Wiseman, Oct 07 2024

Keywords

Comments

The prime numbers are (A000040):
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, ...
with first differences (A001223):
1, 2, 2, 4, 2, 4, 2, 4, 6, 2, 6, 4, 2, 4, 6, 6, 2, 6, 4, 2, 6, 4, 6, 8, 4, 2, ...
with second differences (A036263):
1, 0, 2, -2, 2, -2, 2, 2, -4, 4, -2, -2, 2, 2, 0, -4, 4, -2, -2, 4, -2, 2, 2, ...
with sorted first appearances at (A376656):
1, 2, 3, 4, 9, 10, 29, 30, 33, 34, 96, 98, 99, 154, 179, 180, 189, 216, 217, ...

Crossrefs

These are the sorted positions of first appearances in A036263.
For first differences we had A373400(n) + 1, except initial terms.
For prime-powers instead of prime numbers we have A376653/A376654.
For squarefree instead of prime numbers we have A376655, sorted firsts of A376590.
A000040 lists the prime numbers, differences A001223.
A005117 lists squarefree numbers, complement A013929 (differences A078147).
A333254 lists run-lengths of differences between consecutive primes.
For second differences: A073445 (composite), A376559 (perfect-power), A376562 (non-perfect-power), A376593 (nonsquarefree), A376596 (prime-power inclusive), A376599 (non-prime-power inclusive).
Cf. A064113, A175632, A251092, A258025, A258026, A333214, A373402, A376305, A376311.

Programs

  • Mathematica
    q=Differences[Select[Range[1000],PrimeQ],2];
Select[Range[Length[q]],!MemberQ[Take[q,#-1],q[[#]]]&]

A379542 Second term of the n-th differences of the prime numbers.

Original entry on oeis.org

3, 2, 0, 2, -6, 14, -30, 62, -122, 220, -344, 412, -176, -944, 4112, -11414, 26254, -53724, 100710, -175034, 281660, -410896, 506846, -391550, -401486, 2962260, -9621128, 24977308, -57407998, 120867310, -236098336, 428880422, -719991244, 1096219280
Offset: 0

Views

Author

Gus Wiseman, Jan 12 2025

Keywords

Comments

Also the inverse zero-based binomial transform of the odd prime numbers.

Crossrefs

For all primes (not just odd) we have A007442.
Including 1 in the primes gives A030016.
Column n=2 of A095195.
The version for partitions is A320590 (first column A281425), see A175804, A053445.
For nonprime instead of prime we have A377036, see A377034-A377037.
Arrays of differences: A095195, A376682, A377033, A377038, A377046, A377051.
A000040 lists the primes, differences A001223, A036263.
A002808 lists the composite numbers, differences A073783, A073445.
A008578 lists the noncomposite numbers, differences A075526.
Cf. A064113, A065890, A084758, A140119, A173390, A258025, A258026, A293467, A333214, A333254, A377041.

Programs

  • Mathematica
    nn=40;Table[Differences[Prime[Range[nn+2]],n][[2]],{n,0,nn}]
  • PARI
    a(n) = sum(k=0, n, (-1)^(n-k) * binomial(n,k) * prime(k+2)); \\ Michel Marcus, Jan 12 2025

Formula

a(n) = Sum_{k=0..n} (-1)^(n-k) * binomial(n,k) * prime(k+2).
Previous Showing 21-27 of 27 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.