A056753 -id:A056753 - cp's OEIS frontend

A005843 The nonnegative even numbers: a(n) = 2n.

0, 2, 4, 6, 8, 10, 12, 14, 16, 18, 20, 22, 24, 26, 28, 30, 32, 34, 36, 38, 40, 42, 44, 46, 48, 50, 52, 54, 56, 58, 60, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120

Offset: 0

N. J. A. Sloane

-2, -4, -6, -8, -10, -12, -14, ... are the trivial zeros of the Riemann zeta function. - Vivek Suri (vsuri(AT)jhu.edu), Jan 24 2008
If a 2-set Y and an (n-2)-set Z are disjoint subsets of an n-set X then a(n-2) is the number of 2-subsets of X intersecting both Y and Z. - Milan Janjic, Sep 19 2007
A134452(a(n)) = 0; A134451(a(n)) = 2 for n > 0. - Reinhard Zumkeller, Oct 27 2007
Omitting the initial zero gives the number of prime divisors with multiplicity of product of terms of n-th row of A077553. - Ray Chandler, Aug 21 2003
A059841(a(n))=1, A000035(a(n))=0. - Reinhard Zumkeller, Sep 29 2008
(APSO) Alternating partial sums of (a-b+c-d+e-f+g...) = (a+b+c+d+e+f+g...) - 2*(b+d+f...), it appears that APSO(A005843) = A052928 = A002378 - 2*(A116471), with A116471=2*A008794. - Eric Desbiaux, Oct 28 2008
A056753(a(n)) = 1. - Reinhard Zumkeller, Aug 23 2009
Twice the nonnegative numbers. - Juri-Stepan Gerasimov, Dec 12 2009
The number of hydrogen atoms in straight-chain (C(n)H(2n+2)), branched (C(n)H(2n+2), n > 3), and cyclic, n-carbon alkanes (C(n)H(2n), n > 2). - Paul Muljadi, Feb 18 2010
For n >= 1; a(n) = the smallest numbers m with the number of steps n of iterations of {r - (smallest prime divisor of r)} needed to reach 0 starting at r = m. See A175126 and A175127. A175126(a(n)) = A175126(A175127(n)) = n. Example (a(4)=8): 8-2=6, 6-2=4, 4-2=2, 2-2=0; iterations has 4 steps and number 8 is the smallest number with such result. - Jaroslav Krizek, Feb 15 2010
For n >= 1, a(n) = numbers k such that arithmetic mean of the first k positive integers is not integer. A040001(a(n)) > 1. See A145051 and A040001. - Jaroslav Krizek, May 28 2010
Union of A179082 and A179083. - Reinhard Zumkeller, Jun 28 2010
a(k) is the (Moore lower bound on and the) order of the (k,4)-cage: the smallest k-regular graph having girth four: the complete bipartite graph with k vertices in each part. - Jason Kimberley, Oct 30 2011
For n > 0: A048272(a(n)) <= 0. - Reinhard Zumkeller, Jan 21 2012
Let n be the number of pancakes that have to be divided equally between n+1 children. a(n) is the minimal number of radial cuts needed to accomplish the task. - Ivan N. Ianakiev, Sep 18 2013
For n > 0, a(n) is the largest number k such that (k!-n)/(k-n) is an integer. - Derek Orr, Jul 02 2014
a(n) when n > 2 is also the number of permutations simultaneously avoiding 213, 231 and 321 in the classical sense which can be realized as labels on an increasing strict binary tree with 2n-1 nodes. See A245904 for more information on increasing strict binary trees. - Manda Riehl Aug 07 2014
It appears that for n > 2, a(n) = A020482(n) + A002373(n), where all sequences are infinite. This is consistent with Goldbach's conjecture, which states that every even number > 2 can be expressed as the sum of two prime numbers. - Bob Selcoe, Mar 08 2015
Number of partitions of 4n into exactly 2 parts. - Colin Barker, Mar 23 2015
Number of neighbors in von Neumann neighborhood. - Dmitry Zaitsev, Nov 30 2015
Unique solution b( ) of the complementary equation a(n) = a(n-1)^2 - a(n-2)*b(n-1), where a(0) = 1, a(1) = 3, and a( ) and b( ) are increasing complementary sequences. - Clark Kimberling, Nov 21 2017
Also the maximum number of non-attacking bishops on an (n+1) X (n+1) board (n>0). (Cf. A000027 for rooks and queens (n>3), A008794 for kings or A030978 for knights.) - Martin Renner, Jan 26 2020
Integer k is even positive iff phi(2k) > phi(k), where phi is Euler's totient (A000010) [see reference De Koninck & Mercier]. - Bernard Schott, Dec 10 2020
Number of 3-permutations of n elements avoiding the patterns 132, 213, 312 and also number of 3-permutations avoiding the patterns 213, 231, 321. See Bonichon and Sun. - Michel Marcus, Aug 20 2022
a(n) gives the y-value of the integral solution (x,y) of the Pellian equation x^2 - (n^2 + 1)*y^2 = 1. The x-value is given by 2*n^2 + 1 (see Tattersall). - Stefano Spezia, Jul 24 2025

			G.f. = 2*x + 4*x^2 + 6*x^3 + 8*x^4 + 10*x^5 + 12*x^6 + 14*x^7 + 16*x^8 + ...

T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 2.
John H. Conway and Richard K. Guy, The Book of Numbers, New York: Springer-Verlag, 1996. See p. 28.
J.-M. De Koninck and A. Mercier, 1001 Problèmes en Théorie Classique des Nombres, Problème 529a pp. 71 and 257, Ellipses, 2004, Paris.
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 256.

N. J. A. Sloane, Table of n, a(n) for n = 0..10000
Nicolas Bonichon and Pierre-Jean Morel, Baxter d-permutations and other pattern avoiding classes, arXiv:2202.12677 [math.CO], 2022.
David Callan, On Ascent, Repetition and Descent Sequences, arXiv:1911.02209 [math.CO], 2019.
Charles Cratty, Samuel Erickson, Frehiwet Negass, and Lara Pudwell, Pattern Avoidance in Double Lists, preprint, 2015.
Kevin Fagan, Drabble cartoon, Jun 15 1987: Intelligence Test
Adam M. Goyt and Lara K. Pudwell, Avoiding colored partitions of two elements in the pattern sense, arXiv preprint arXiv:1203.3786 [math.CO], 2012, J. Int. Seq. 15 (2012) # 12.6.2
Milan Janjic, Two Enumerative Functions
Tanya Khovanova, Recursive Sequences
Simon Plouffe, Approximations de séries génératrices et quelques conjectures, Dissertation, Université du Québec à Montréal, 1992; arXiv:0911.4975 [math.NT], 2009.
Simon Plouffe, 1031 Generating Functions, Appendix to Thesis, Montreal, 1992.
Nathan Sun, On d-permutations and Pattern Avoidance Classes, arXiv:2208.08506 [math.CO], 2022.
Eric Weisstein's World of Mathematics, Even Number
Eric Weisstein's World of Mathematics, Hamiltonian Cycle
Eric Weisstein's World of Mathematics, Riemann Zeta Function Zeros
Wikipedia, Alkane
Index entries for "core" sequences
Index entries for linear recurrences with constant coefficients, signature (2,-1).

a(n)=2*A001477(n). - Juri-Stepan Gerasimov, Dec 12 2009
Cf. A000027, A002061, A005408, A001358, A077553, A077554, A077555, A002024, A087112, A157888, A157889, A140811, A157872, A157909, A157910, A165900.
Moore lower bound on the order of a (k,g) cage: A198300 (square); rows: A000027 (k=2), A027383 (k=3), A062318 (k=4), A061547 (k=5), A198306 (k=6), A198307 (k=7), A198308 (k=8), A198309 (k=9), A198310 (k=10), A094626 (k=11); columns: A020725 (g=3), this sequence (g=4), A002522 (g=5), A051890 (g=6), A188377 (g=7). - Jason Kimberley, Oct 30 2011
Cf. A231200 (boustrophedon transform).

a005843 = (* 2)
a005843_list = [0, 2 ..]  -- Reinhard Zumkeller, Feb 11 2012

Magma
```
[ 2*n : n in [0..100]];
```

A005843 := n->2*n;
A005843:=2/(z-1)**2; # Simon Plouffe in his 1992 dissertation

Range[0,120,2] (* Harvey P. Dale, Aug 16 2011 *)

PARI
```
A005843(n) = 2*n
```

def a(n): return 2*n # Martin Gergov, Oct 20 2022

R
```
seq(0,200,2)
```

G.f.: 2*x/(1-x)^2.
E.g.f.: 2*x*exp(x). - Geoffrey Critzer, Aug 25 2012
G.f. with interpolated zeros: 2x^2/((1-x)^2 * (1+x)^2); e.g.f. with interpolated zeros: x*sinh(x). - Geoffrey Critzer, Aug 25 2012
Inverse binomial transform of A036289, n*2^n. - Joshua Zucker, Jan 13 2006
a(0) = 0, a(1) = 2, a(n) = 2a(n-1) - a(n-2). - Jaume Oliver Lafont, May 07 2008
a(n) = Sum_{k=1..n} floor(6n/4^k + 1/2). - Vladimir Shevelev, Jun 04 2009
a(n) = A034856(n+1) - A000124(n) = A000217(n) + A005408(n) - A000124(n) = A005408(n) - 1. - Jaroslav Krizek, Sep 05 2009
a(n) = Sum_{k>=0} A030308(n,k)*A000079(k+1). - Philippe Deléham, Oct 17 2011
Digit sequence 22 read in base n-1. - Jason Kimberley, Oct 30 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Vincenzo Librandi, Dec 23 2011
a(n) = 2*n = Product_{k=1..2*n-1} 2*sin(Pi*k/(2*n)), n >= 0 (undefined product := 1). See an Oct 09 2013 formula contribution in A000027 with a reference. - Wolfdieter Lang, Oct 10 2013
From Ilya Gutkovskiy, Aug 19 2016: (Start)
Convolution of A007395 and A057427.
Sum_{n>=1} (-1)^(n+1)/a(n) = log(2)/2 = (1/2)*A002162 = (1/10)*A016655. (End)
From Bernard Schott, Dec 10 2020: (Start)
Sum_{n>=1} 1/a(n)^2 = Pi^2/24 = A222171.
Sum_{n>=1} (-1)^(n+1)/a(n)^2 = Pi^2/48 = A245058. (End)

A016813 a(n) = 4*n + 1.

Original entry on oeis.org

1, 5, 9, 13, 17, 21, 25, 29, 33, 37, 41, 45, 49, 53, 57, 61, 65, 69, 73, 77, 81, 85, 89, 93, 97, 101, 105, 109, 113, 117, 121, 125, 129, 133, 137, 141, 145, 149, 153, 157, 161, 165, 169, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209, 213, 217, 221, 225, 229, 233, 237

Offset: 0

N. J. A. Sloane

Apart from initial term(s), dimension of the space of weight 2n cusp forms for Gamma_0( 23 ).
Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 64 ).
Numbers k such that k and (k+1) have the same binary digital sum. - Benoit Cloitre, Jun 05 2002
Numbers k such that (1 + sqrt(k))/2 is an algebraic integer. - Alonso del Arte, Jun 04 2012
Numbers k such that 2 is the only prime p that satisfies the relationship p XOR k = p + k. - Brad Clardy, Jul 22 2012
This may also be interpreted as the array T(n,k) = A001844(n+k) + A008586(k) read by antidiagonals:
    1,   9,  21,  37,  57,  81, ...
    5,  17,  33,  53,  77, 105, ...
   13,  29,  49,  73, 101, 133, ...
   25,  45,  69,  97, 129, 165, ...
   41,  65,  93, 125, 161, 201, ...
   61,  89, 121, 157, 197, 241, ...
   ...
- R. J. Mathar, Jul 10 2013
With leading term 2 instead of 1, 1/a(n) is the largest tolerance of form 1/k, where k is a positive integer, so that the nearest integer to (n - 1/k)^2 and to (n + 1/k)^2 is n^2. In other words, if interval arithmetic is used to square [n - 1/k, n + 1/k], every value in the resulting interval of length 4n/k rounds to n^2 if and only if k >= a(n). - Rick L. Shepherd, Jan 20 2014
Odd numbers for which the number of prime factors congruent to 3 (mod 4) is even. - Daniel Forgues, Sep 20 2014
For the Collatz conjecture, we identify two types of odd numbers. This sequence contains all the descenders: where (3*a(n) + 1) / 2 is even and requires additional divisions by 2. See A004767 for the ascenders. - Fred Daniel Kline, Nov 29 2014 [corrected by Jaroslav Krizek, Jul 29 2016]
a(n-1), n >= 1, is also the complex dimension of the manifold M(S), the set of all conjugacy classes of irreducible representations of the fundamental group pi_1(X,x_0) of rank 2, where S = {a_1, ..., a_{n}, a_{n+1} = oo}, a subset of P^1 = C U {oo}, X = X(S) = P^1 \ S, and x_0 a base point in X. See the Iwasaki et al. reference, Proposition 2.1.4. p. 150. - Wolfdieter Lang, Apr 22 2016
For n > 3, also the number of (not necessarily maximal) cliques in the n-sunlet graph. - Eric W. Weisstein, Nov 29 2017
For integers k with absolute value in A047202, also exponents of the powers of k having the same unit digit of k in base 10. - Stefano Spezia, Feb 23 2021
Starting with a(1) = 5, numbers ending with 01 in base 2. - John Keith, May 09 2022

			From _Leo Tavares_, Jul 02 2021: (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
(End)

K. Iwasaki, H. Kimura, S. Shimomura and M. Yoshida, From Gauss to Painlevé, Vieweg, 1991. p. 150.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Colin Defant and Noah Kravitz, Loops and Regions in Hitomezashi Patterns, arXiv:2201.03461 [math.CO], 2022. Theorem 1.3.
Gennady Eremin, Partitioning the set of natural numbers into Mersenne trees and into arithmetic progressions; Natural Matrix and Linnik's constant, arXiv:2405.16143 [math.CO], 2024. See pp. 5, 8, 14.
Gennady Eremin, Infinite matrix of odd natural numbers. A bit about Sophie Germain prime numbers, arXiv:2501.17090 [math.GM], 2025. See pp. 3, 11.
L. B. W. Jolley, Summation of Series, Dover Publications, 1961, p. 16.
Tanya Khovanova, Recursive Sequences
Konrad Knopp, Theorie und Anwendung der unendlichen Reihen, Berlin, J. Springer, 1922. (Original German edition of "Theory and Application of Infinite Series")
Konrad Knopp, Theory and Application of Infinite Series, Dover, p. 269.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv preprint arXiv:1406.3081 [math.CO], 2014-2015.
William A. Stein's The Modular Forms Database, PARI-readable dimension tables for Gamma_0(N)
Eric Weisstein's World of Mathematics, Clique
Eric Weisstein's World of Mathematics, Hilbert Number
Eric Weisstein's World of Mathematics, Sunlet Graph
Wikipedia, Interval arithmetic
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Subsequence of A042963 and of A079523.
a(n) = A093561(n+1, 1), (4, 1)-Pascal column.
Cf. A016921, A017281, A017533, A047202, A158057, A161705, A161709, A161714, A128470. - Reinhard Zumkeller, Jun 17 2009
Cf. A004772 (complement).
Cf. A017557.

List([0..70],n->4*n+1); # Muniru A Asiru, Aug 08 2018

a016813 = (+ 1) . (* 4)
a016813_list = [1, 5 ..]  -- Reinhard Zumkeller, Feb 14 2012

Magma
```
[n: n in [1..250 by 4]];
```

seq(4*k+1, k=0..100); # Wesley Ivan Hurt, Sep 28 2013

Range[1, 237, 4] (* Vladimir Joseph Stephan Orlovsky, May 26 2011 *)
Table[4 n + 1, {n, 0, 20}] (* Eric W. Weisstein, Nov 29 2017 *)
4 Range[0, 20] + 1 (* Eric W. Weisstein, Nov 29 2017 *)
LinearRecurrence[{2, -1}, {5, 9}, {0, 20}] (* Eric W. Weisstein, Nov 29 2017 *)
CoefficientList[Series[(1 + 3 x)/(-1 + x)^2, {x, 0, 20}], x] (* Eric W. Weisstein, Nov 29 2017 *)

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

x='x+O('x^100); Vec((1+3*x)/(1-x)^2) \\ Altug Alkan, Oct 22 2015

(0 to 59).map(4 *  + 1) // _Alonso del Arte, Aug 08 2018

a(n) = A005408(2*n).
Sum_{n>=0} (-1)^n/a(n) = (1/(4*sqrt(2)))*(Pi+2*log(sqrt(2)+1)) = A181048 [Jolley]. - Benoit Cloitre, Apr 05 2002 [corrected by Amiram Eldar, Jul 30 2023]
G.f.: (1+3*x)/(1-x)^2. - Paul Barry, Feb 27 2003 [corrected for offset 0 by Wolfdieter Lang, Oct 03 2014]
(1 + 5*x + 9*x^2 + 13*x^3 + ...) = (1 + 2*x + 3*x^2 + ...) / (1 - 3*x + 9*x^2 - 27*x^3 + ...). - Gary W. Adamson, Jul 03 2003
a(n) = A001969(n) + A000069(n). - Philippe Deléham, Feb 04 2004
a(n) = A004766(n-1). - R. J. Mathar, Oct 26 2008
a(n) = 2*a(n-1) - a(n-2); a(0)=1, a(1)=5. a(n) = 4 + a(n-1). - Philippe Deléham, Nov 03 2008
A056753(a(n)) = 3. - Reinhard Zumkeller, Aug 23 2009
A179821(a(n)) = a(A179821(n)). - Reinhard Zumkeller, Jul 31 2010
a(n) = 8*n - 2 - a(n-1) for n > 0, a(0) = 1. - Vincenzo Librandi, Nov 20 2010
The identity (4*n+1)^2 - (4*n^2+2*n)*(2)^2 = 1 can be written as a(n)^2 - A002943(n)*2^2 = 1. - Vincenzo Librandi, Mar 11 2009 - Nov 25 2012
A089911(6*a(n)) = 8. - Reinhard Zumkeller, Jul 05 2013
a(n) = A004767(n) - 2. - Jean-Bernard François, Sep 27 2013
a(n) = A058281(3n+1). - Eli Jaffe, Jun 07 2016
From Ilya Gutkovskiy, Jul 29 2016: (Start)
E.g.f.: (1 + 4*x)*exp(x).
a(n) = Sum_{k = 0..n} A123932(k).
a(A005098(k)) = x^2 + y^2.
Inverse binomial transform of A014480. (End)
Dirichlet g.f.: 4*Zeta(-1 + s) + Zeta(s). - Stefano Spezia, Nov 02 2018

A004771 a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.

Original entry on oeis.org

7, 15, 23, 31, 39, 47, 55, 63, 71, 79, 87, 95, 103, 111, 119, 127, 135, 143, 151, 159, 167, 175, 183, 191, 199, 207, 215, 223, 231, 239, 247, 255, 263, 271, 279, 287, 295, 303, 311, 319, 327, 335, 343, 351, 359, 367, 375, 383, 391, 399, 407, 415, 423, 431

Offset: 0

N. J. A. Sloane

These numbers cannot be expressed as the sum of 3 squares. - Artur Jasinski, Nov 22 2006
These numbers cannot be perfect squares. - Cino Hilliard, Sep 03 2006
a(n-2), n >= 2, appears in the second column of triangle A239126 related to the Collatz problem. - Wolfdieter Lang, Mar 14 2014
The initial terms 7, 15, 23, 31 are the generating set for the rest of the sequence in the sense that, by Lagrange's Four Square Theorem, any number n of the form 8*k+7 can always be written as a sum of no fewer than four squares, and if n = a^2 + b^2 + c^2 + d^2, then (a mod 4)^2 + (b mod 4)^2 + (c mod 4)^2 + (d mod 4)^2 must be one of 7, 15, 23, 31. - Walter Kehowski, Jul 07 2014
Define a set of consecutive positive odd numbers {1, 3, 5, ..., 12*n + 9} and skip the number 6*n + 5. Then the contraharmonic mean of that set gives this sequence. For example, ContraharmonicMean[{1, 3, 7, 9}] = 7. - Hilko Koning, Aug 27 2018
Jacobi symbol (2, a(n)) = Kronecker symbol (a(n), 2) = 1. - Jianing Song, Aug 28 2018

James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 246.

Vincenzo Librandi, Table of n, a(n) for n = 0..5000
Tanya Khovanova, Recursive Sequences
Leo Tavares, Illustration: Twin Square Frames
Leo Tavares, Illustration: Mid-line Hexagons
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 962
Index entries for linear recurrences with constant coefficients, signature (2,-1).

Cf. A004767, A008590, A017077, A017101, A017137, A033954.
Cf. A007522 (primes), subsequence of A047522.
Cf. A056753, A227144, A227146, A239126.

List([0..60],n->8*n+7); # Muniru A Asiru, Aug 28 2018

a004771 = (+ 7) . (* 8)
a004771_list = [7, 15 ..]  -- Reinhard Zumkeller, Jan 29 2013

[8*n+7: n in [0..60]]; // Vincenzo Librandi, May 28 2011

A004771:=n->8*n+7; seq(A004771(n), n=0..100); # Wesley Ivan Hurt, Dec 22 2013

8 Range[0, 60] + 7 (* or *) Range[7, 500, 8] (* or *) Table[8 n + 7, {n, 0, 60}] (* Bruno Berselli, Dec 28 2016 *)

a(n)=8*n+7 \\ Charles R Greathouse IV, Sep 23 2012

O.g.f: (7 + x)/(1 - x)^2 = 8/(1 - x)^2 - 1/(1 - x). - R. J. Mathar, Nov 30 2007
a(n) = 2*a(n-1) - a(n-2) for n >= 2.  - Vincenzo Librandi, May 28 2011
A056753(a(n)) = 7. - Reinhard Zumkeller, Aug 23 2009
a(n) = t(t(t(n))), where t(i) = 2*i + 1.
a(n) = A004767(2*n+1), for n >= 0. See also A004767(2*n) = A017101(n). - Wolfdieter Lang, Feb 03 2022
From Elmo R. Oliveira, Apr 11 2024: (Start)
E.g.f.: exp(x)*(7 + 8*x).
a(n) = A033954(n+1) - A033954(n). (End)

cp's OEIS Frontend

A181497 a(n) is the smallest m such that A056753(m) = 2*n + 1.

Views

Author

Keywords

Comments

Links

Programs

Magma

Maple

Mathematica

A005843 The nonnegative even numbers: a(n) = 2n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Python

R

Formula

A016813 a(n) = 4*n + 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

PARI

Scala

Formula

A004771 a(n) = 8*n + 7. Or, numbers whose binary expansion ends in 111.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Formula

A164632 a(1) = 1 followed by 2^k appearing 2^(2*k-1) times for k>0.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

Formula

Extensions