A269345 -id:A269345 - cp's OEIS frontend

A016921 a(n) = 6*n + 1.

1, 7, 13, 19, 25, 31, 37, 43, 49, 55, 61, 67, 73, 79, 85, 91, 97, 103, 109, 115, 121, 127, 133, 139, 145, 151, 157, 163, 169, 175, 181, 187, 193, 199, 205, 211, 217, 223, 229, 235, 241, 247, 253, 259, 265, 271, 277, 283, 289, 295, 301, 307, 313, 319, 325, 331

Offset: 0

N. J. A. Sloane

Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 22 ).
Also solutions to 2^x + 3^x == 5 (mod 7). - Cino Hilliard, May 10 2003
Except for 1, exponents n > 1 such that x^n - x^2 - 1 is reducible. - N. J. A. Sloane, Jul 19 2005
Let M(n) be the n X n matrix m(i,j) = min(i,j); then the trace of M(n)^(-2) is a(n-1) = 6*n - 5. - Benoit Cloitre, Feb 09 2006
If Y is a 3-subset of an (2n+1)-set X then, for n >= 3, a(n-1) is the number of 3-subsets of X having at least two elements in common with Y. - Milan Janjic, Dec 16 2007
All composite terms belong to A269345 as shown in there. - Waldemar Puszkarz, Apr 13 2016
First differences of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 773", based on the 5-celled von Neumann neighborhood. - Robert Price, May 23 2016
For b(n) = A103221(n) one has b(a(n)-1) = b(a(n)+1) = b(a(n)+2) = b(a(n)+3) = b(a(n)+4) = n+1 but b(a(n)) = n. So-called "dips" in A103221. See the Avner and Gross remark on p. 178. - Wolfdieter Lang, Sep 16 2016
A (n+1,n) pebbling move involves removing n + 1 pebbles from a vertex in a simple graph and placing n pebbles on an adjacent vertex. A two-player impartial (n+1,n) pebbling game involves two players alternating (n+1,n) pebbling moves. The first player unable to make a move loses. The sequence a(n) is also the minimum number of pebbles such that any assignment of those pebbles on a complete graph with 3 vertices is a next-player winning game in the two player impartial (k+1,k) pebbling game. These games are represented by A347637(3,n). - Joe Miller, Oct 18 2021
Interleaving of A017533 and A017605. - Leo Tavares, Nov 16 2021

			From _Ilya Gutkovskiy_, Apr 15 2016: (Start)
Illustration of initial terms:
                      o
                    o o o
              o     o o o
            o o o   o o o
      o     o o o   o o o
    o o o   o o o   o o o
o   o o o   o o o   o o o
n=0  n=1     n=2     n=3
(End)

Avner Ash and Robert Gross, Summing it up, Princeton University Press, 2016, p. 178.

G. C. Greubel, Table of n, a(n) for n = 0..1000
Kayla Barker, Mia DeStefano, Eugene Fiorini, Michael Gohn, Joe Miller, Jacob Roeder, and Tony W. H. Wong, Generalized Impartial Two-player Pebbling Games on K_3 and C_4, J. Int. Seq. (2024) Vol. 27, Issue 5, Art. No. 24.5.8. See p. 3.
Tanya Khovanova, Recursive Sequences.
William A. Stein, Dimensions of the spaces S_k(Gamma_0(N)).
William A. Stein, The modular forms database.
Leo Tavares, Illustration: Hexagonal Lines.
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A093563 ((6, 1) Pascal, column m=1).
Cf. A000567 (partial sums), A002476 (primes), A005408, A008588, A016813, A016933, A016945, A016957, A017281, A017533, A128470, A158057, A161700, A161705, A161709, A161714.
a(n) = A007310(2*(n+1)); complement of A016969 with respect to A007310.
Cf. A287326 (second column).
Cf. A000217, A003215.
Cf. A001477, A017605.

List([0..60], n-> 6*n+1); # G. C. Greubel, Sep 18 2019

a016921 = (+ 1) . (* 6)
a016921_list = [1, 7 ..]  -- Reinhard Zumkeller, Jan 15 2013

[6*n+1: n in [0..60]]; // G. C. Greubel, Sep 18 2019

a[1]:=1:for n from 2 to 100 do a[n]:=a[n-1]+6 od: seq(a[n], n=1..56); # Zerinvary Lajos, Mar 16 2008

Range[1, 500, 6] (* Vladimir Joseph Stephan Orlovsky, May 26 2011 *)

a(n)=6*n+1 \\ Charles R Greathouse IV, Mar 22 2016

for n in range(0,10**5):print(6*n+1) # Soumil Mandal, Apr 14 2016

a(n) = 6*n + 1, n >= 0 (see the name).
G.f.: (1+5*x)/(1-x)^2.
A008615(a(n)) = n. - Reinhard Zumkeller, Feb 27 2008
A157176(a(n)) = A013730(n). - Reinhard Zumkeller, Feb 24 2009
a(n) = 4*(3*n-1) - a(n-1) (with a(0)=1). - Vincenzo Librandi, Nov 20 2010
E.g.f.: (1 + 6*x)*exp(x). - G. C. Greubel, Sep 18 2019
a(n) = A003215(n) - 6*A000217(n-1). See Hexagonal Lines illustration. - Leo Tavares, Sep 10 2021
From Leo Tavares, Oct 27 2021: (Start)
a(n) = 6*A001477(n-1) + 7
a(n) = A016813(n) + 2*A001477(n)
a(n) = A017605(n-1) + A008588(n-1)
a(n) = A016933(n) - 1
a(n) = A008588(n) + 1. (End)
Sum_{n>=0} (-1)^n/a(n) = Pi/6 + sqrt(3)*arccoth(sqrt(3))/3. - Amiram Eldar, Dec 10 2021

A106564 Perfect squares which are not the difference of two primes.

Original entry on oeis.org

25, 49, 121, 169, 289, 361, 529, 625, 729, 841, 961, 1225, 1369, 1681, 1849, 2209, 2401, 2601, 2809, 3025, 3481, 3721, 3969, 4225, 4489, 4761, 5041, 5329, 5625, 5929, 6241, 6889, 7225, 7569, 7921, 8281, 8649, 9025, 9409, 10201, 10609, 11449, 11881

Offset: 1

Alexandre Wajnberg, May 09 2005

Squares in A269345; see also the Mathematica code. - Waldemar Puszkarz, Feb 27 2016

It is conjectured (see A020483) that every even number is a difference of primes, and this is known to be true for even numbers < 10^11. If so,this sequence consists of the odd squares n such that n+2 is composite. - Robert Israel, Feb 28 2016

			a(2)=49 because it is the second perfect square which is impossible to obtain subtracting a prime from another one.
64 is not in the sequence because 64=67-3 (difference of two primes).

Robert Israel, Table of n, a(n) for n = 1..10000

Cf. A020483, A106544-A106548, A106562-A106563, A106571, A106573-A106575, A106577.

[n^2: n in [1..150]| not IsPrime(n^2+2) and n mod 2 eq 1]; // Vincenzo Librandi, Feb 28 2016

remove(t -> isprime(t+2), [seq(i^2, i=1..1000, 2)]); # Robert Israel, Feb 28 2016

With[{lst=Union[(#[[2]]-#[[1]])&/@Subsets[Prime[Range[2000]], {2}]]}, Select[Range[140]^2, !MemberQ[lst,#]&]] (* Harvey P. Dale, Jan 04 2011 *)
Select[Range[1,174,2]^2, !PrimeQ[#+2]&]
Select[Select[Range[30000], OddQ[#]&& !PrimeQ[#]&& !PrimeQ[#+2]&], IntegerQ[Sqrt[#]]&] (* Waldemar Puszkarz, Feb 27 2016 *)

for(n=1, 174, n%2==1&&!isprime(n^2+2)&&print1(n^2, ", ")) \\ Waldemar Puszkarz, Feb 27 2016

n^2 - A106546 with 0's removed.

Extended by Ray Chandler, May 12 2005

A298366 Even numbers n such that n-5 and n-3 are both composite.

Original entry on oeis.org

30, 38, 54, 60, 68, 80, 90, 96, 98, 120, 122, 124, 126, 128, 138, 146, 148, 150, 158, 164, 174, 180, 188, 190, 192, 206, 208, 210, 212, 218, 220, 222, 224, 240, 248, 250, 252, 258, 264, 270, 278, 290, 292, 294, 300, 302, 304, 306, 308, 324, 326, 328, 330, 332, 338, 344, 346, 348, 360, 366, 368, 374, 380

Offset: 1

David James Sycamore, Jan 17 2018

nonn

The sequence displays runs of consecutive even integers, whose frequency and length are related to gaps between successive primes local to these numbers. Where primes are rare (large gaps), the runs of consecutive even integers are longer (run length proportional to gap size). Let p < q be consecutive primes such that g = q-p >= 6. A string of r consecutive terms differing by 2 will start at p+7, and continue to q+1, where r = (g-4)/2. Thus at prime gap 8 a string of 2 consecutive terms differing by 2 will occur, at gap 10 there will be 3, and at gap 30 there will be 13; and so on. As the gap size increases by 2 so the run length of consecutive even terms increases by 1. The first occurrence of run length m occurs at the term corresponding to 7 + A000230(m/2).
The terms in this sequence, combined with those in A297925 and A298252 form a partition of A005843(n); n >= 3; (nonnegative even numbers >= 6). This is because any even integer n >= 6 satisfies either: (i). n-3 is prime, (ii). n-5 is prime and n-3 is composite, or (iii). both n-5 and n-3 are composite.
For any n >= 1, A056240(a(n)) = A298615(n).

			30 is included because 30-5 = 25, and 30-3 = 27; both composite, and 30 is the smallest even number with this property, hence a(1)=30. Also, A056240(a(1)) = A056240(30) = 161 = A298615(1). 24 is not included because although 24 - 3 = 21, composite; 24 - 5 = 19, prime. 210 is in this sequence, since 205 and 207 are both composite. 113 is the first prime to have a gap 14 ahead of it. Therefore we would expect a run of (14 - 4)/2 = 5 consecutive terms to start at 7 + A000230(7) = 113 + 7 = 120; thus: 120,122,124,126,128. Likewise the first occurrence of run length 7 occurs at gap m = 2*7 + 4 = 18, namely the term corresponding to 7 + A000230(9) = 523 + 7 = 530; thus: 530,532,534,536,538,540,542.

Vincenzo Librandi, Table of n, a(n) for n = 1..7000

Cf. A297925, A298252, A005843, A000230.

[2*n: n in [8..200] | not IsPrime(2*n-5) and not IsPrime(2*n-3)]; // Vincenzo Librandi, Nov 16 2018

N:=300:
for n from 8 to N by 2 do
if not isprime(n-5) and not isprime(n-3) then print(n);
end if
end do

Rest[2 Select[Range[250], !PrimeQ[2 # - 5] && !PrimeQ[2 # - 3] &]] (* Vincenzo Librandi, Nov 16 2018 *)
Select[Range[2,400,2],AllTrue[#-{3,5},CompositeQ]&] (* Harvey P. Dale, Jul 01 2025 *)

select( is_A298366(n)=!(isprime(n-5)||isprime(n-3)||bitand(n,1)||n<9), [5..200]*2) \\ Last 2 conditions aren't needed if n > 4 and even. - M. F. Hasler, Nov 19 2018 and Apr 07 2020 after edit by Michel Marcus, Apr 04 2020

a(n) = A061673(n) + 4 = A269345(n) + 5. - M. F. Hasler, Nov 19 2018

A269346 Perfect cubes that are not the difference of two primes.

Original entry on oeis.org

343, 729, 1331, 2197, 3375, 4913, 6859, 9261, 12167, 15625, 19683, 29791, 35937, 42875, 50653, 59319, 68921, 79507, 103823, 117649, 132651, 148877, 166375, 185193, 205379, 226981, 300763, 389017, 421875, 456533, 493039, 531441, 614125, 658503, 704969

Offset: 1

Waldemar Puszkarz, Feb 24 2016

nonn

An even number can be the difference of two primes, but an odd one can only be if an odd number m is such that m+2 is prime. Since a(n) is odd and such that a(n)+2 is composite, a(n) cannot be such a difference.
The cubes of this property are also the cubes in A269345.
It is still an open conjecture that every even number is the difference of 2 primes. On the other hand, a computer test shows that all even cubes <= 10^21 can be written as the difference of 2 primes. The computer program generating the sequence needs an additional part to test for even cubes besides checking that for odd m^3, m^3+2 is composite. - Chai Wah Wu, Mar 03 2016

			For n=1, 343 = 7^3 and 345 = 343+2 is a composite, so 343 is a term.

Chai Wah Wu, Table of n, a(n) for n = 1..10000

Cf. A000578 (the cubes), A067200 (cube roots of terms that complement this sequence), A269345 (supersequence).

[n^3: n in [1..150 by 2] | not IsPrime(n^3+2)]; // Vincenzo Librandi, Feb 28 2016

Select[Range[1,125,2]^3, !PrimeQ[#+2]&]
Select[Range[125]^3, !PrimeQ[#+2]&&OddQ[#]&]
Select[Select[Range[2000000], OddQ[#]&& !PrimeQ[#]&& !PrimeQ[#+2]&], IntegerQ[CubeRoot[#]]&]

for(n=1, 125, n%2==1&&!isprime(n^3+2)&&print1(n^3, ", "))

cp's OEIS Frontend

A016921 a(n) = 6*n + 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Formula

A106564 Perfect squares which are not the difference of two primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

Extensions

A298366 Even numbers n such that n-5 and n-3 are both composite.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A269346 Perfect cubes that are not the difference of two primes.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI