A247375 -id:A247375 - cp's OEIS frontend

A001105 a(n) = 2*n^2.

0, 2, 8, 18, 32, 50, 72, 98, 128, 162, 200, 242, 288, 338, 392, 450, 512, 578, 648, 722, 800, 882, 968, 1058, 1152, 1250, 1352, 1458, 1568, 1682, 1800, 1922, 2048, 2178, 2312, 2450, 2592, 2738, 2888, 3042, 3200, 3362, 3528, 3698, 3872, 4050, 4232, 4418

Offset: 0

Bernd.Walter(AT)frankfurt.netsurf.de

Number of edges of the complete bipartite graph of order 3n, K_{n,2n}. - Roberto E. Martinez II, Jan 07 2002
"If each period in the periodic system ends in a rare gas ..., the number of elements in a period can be found from the ordinal number n of the period by the formula: L = ((2n+3+(-1)^n)^2)/8..." - Nature, Jun 09 1951; Nature 411 (Jun 07 2001), p. 648. This produces the present sequence doubled up.
Let z(1) = i = sqrt(-1), z(k+1) = 1/(z(k)+2i); then a(n) = (-1)*Imag(z(n+1))/Real(z(n+1)). - Benoit Cloitre, Aug 06 2002
Maximum number of electrons in an atomic shell with total quantum number n. Partial sums of A016825. - Jeremy Gardiner, Dec 19 2004
Arithmetic mean of triangular numbers in pairs: (1+3)/2, (6+10)/2, (15+21)/2, ... . - Amarnath Murthy, Aug 05 2005
These numbers form a pattern on the Ulam spiral similar to that of the triangular numbers. - G. Roda, Oct 20 2010
Integral areas of isosceles right triangles with rational legs (legs are 2n and triangles are nondegenerate for n > 0). - Rick L. Shepherd, Sep 29 2009
Even squares divided by 2. - Omar E. Pol, Aug 18 2011
Number of stars when distributed as in the U.S.A. flag: n rows with n+1 stars and, between each pair of these, one row with n stars (i.e., n-1 of these), i.e., n*(n+1)+(n-1)*n = 2*n^2 = A001105(n). - César Eliud Lozada, Sep 17 2012
Apparently the number of Dyck paths with semilength n+3 and an odd number of peaks and the central peak having height n-3. - David Scambler, Apr 29 2013
Sum of the partition parts of 2n into exactly two parts. - Wesley Ivan Hurt, Jun 01 2013
Consider primitive Pythagorean triangles (a^2 + b^2 = c^2, gcd(a, b) = 1) with hypotenuse c (A020882) and respective odd leg a (A180620); sequence gives values c-a, sorted with duplicates removed. - K. G. Stier, Nov 04 2013
Number of roots in the root systems of type B_n and C_n (for n > 1). - Tom Edgar, Nov 05 2013
Area of a square with diagonal 2n. - Wesley Ivan Hurt, Jun 18 2014
This sequence appears also as the first and second member of the quartet [a(n), a(n), p(n), p(n)] of the square of [n, n, n+1, n+1] in the Clifford algebra Cl_2 for n >= 0. p(n) = A046092(n). See an Oct 15 2014 comment on A147973 where also a reference is given. - Wolfdieter Lang, Oct 16 2014
a(n) are the only integers m where (A000005(m) + A000203(m)) = (number of divisors of m + sum of divisors of m) is an odd number. - Richard R. Forberg, Jan 09 2015
a(n) represents the first term in a sum of consecutive integers running to a(n+1)-1 that equals (2n+1)^3. - Patrick J. McNab, Dec 24 2016
Also the number of 3-cycles in the (n+4)-triangular honeycomb obtuse knight graph. - Eric W. Weisstein, Jul 29 2017
Also the Wiener index of the n-cocktail party graph for n > 1. - Eric W. Weisstein, Sep 07 2017
Numbers represented as the palindrome 242 in number base B including B=2 (binary), 3 (ternary) and 4: 242(2)=18, 242(3)=32, 242(4)=50, ... 242(9)=200, 242(10)=242, ... - Ron Knott, Nov 14 2017
a(n) is the square of the hypotenuse of an isosceles right triangle whose sides are equal to n. - Thomas M. Green, Aug 20 2019
The sequence contains all odd powers of 2 (A004171) but no even power of 2 (A000302). - Torlach Rush, Oct 10 2019
From Bernard Schott, Aug 31 2021 and Sep 16 2021: (Start)
Apart from 0, integers such that the number of even divisors (A183063) is odd.
Proof: every n = 2^q * (2k+1), q, k >= 0, then 2*n^2 = 2^(2q+1) * (2k+1)^2; now, gcd(2, 2k+1) = 1, tau(2^(2q+1)) = 2q+2 and tau((2k+1)^2) = 2u+1 because (2k+1)^2 is square, so, tau(2*n^2) = (2q+2) * (2u+1).
The 2q+2 divisors of 2^(2q+1) are {1, 2, 2^2, 2^3, ..., 2^(2q+1)}, so 2^(2q+1) has 2q+1 even divisors {2^1, 2^2, 2^3, ..., 2^(2q+1)}.
Conclusion: these 2q+1 even divisors create with the 2u+1 odd divisors of (2k+1)^2 exactly (2q+1)*(2u+1) even divisors of 2*n^2, and (2q+1)*(2u+1) is odd. (End)
a(n) with n>0 are the numbers with period length 2 for Bulgarian and Mancala solitaire. - Paul Weisenhorn, Jan 29 2022
Number of points at L1 distance = 2 from any given point in Z^n. - Shel Kaphan, Feb 25 2023
Integer that multiplies (h^2)/(m*L^2) to give the energy of a 1-D quantum mechanical particle in a box whenever it is an integer multiple of (h^2)/(m*L^2), where h = Planck's constant, m = mass of particle, and L = length of box. - A. Timothy Royappa, Mar 14 2025

			a(3) = 18; since 2(3) = 6 has 3 partitions with exactly two parts: (5,1), (4,2), (3,3).  Adding all the parts, we get: 1 + 2 + 3 + 3 + 4 + 5 = 18. - _Wesley Ivan Hurt_, Jun 01 2013

Peter Atkins, Julio De Paula, and James Keeler, "Atkins' Physical Chemistry," Oxford University Press, 2023, p. 31.
Arthur Beiser, Concepts of Modern Physics, 2nd Ed., McGraw-Hill, 1973.
Martin Gardner, The Colossal Book of Mathematics, Classic Puzzles, Paradoxes and Problems, Chapter 2 entitled "The Calculus of Finite Differences," W. W. Norton and Company, New York, 2001, pages 12-13.
L. B. W. Jolley, "Summation of Series", Dover Publications, 1961, p. 44.
Alain M. Robert, A Course in p-adic Analysis, Springer-Verlag, 2000, p. 213.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Lancelot Hogben, Choice and Chance by Cardpack and Chessboard, Vol. 1, Max Parrish and Co, London, 1950, p. 36.
Milan Janjić, Hessenberg Matrices and Integer Sequences, J. Int. Seq. 13 (2010) # 10.7.8.
Milan Janjić, On Restricted Ternary Words and Insets, arXiv:1905.04465 [math.CO], 2019.
Milan Janjic and Boris Petkovic, A Counting Function, arXiv:1301.4550 [math.CO], 2013. - _N. J. A. Sloane_, Feb 13 2013
Vladimir Ladma, Magic Numbers.
Vladimir Pletser, General solutions of sums of consecutive cubed integers equal to squared integers, arXiv:1501.06098 [math.NT], 2015.
Luis Manuel Rivera, Integer sequences and k-commuting permutations, arXiv:1406.3081 [math.CO], 2014.
Eric Weisstein's World of Mathematics, Cocktail Party Graph.
Eric Weisstein's World of Mathematics, Graph Cycle.
Eric Weisstein's World of Mathematics, Wiener Index.
Index entries for sequences related to Chebyshev polynomials.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000290, A006331 (partial sums), A016742, A056106, A116471, A245508, A251599, A002061, A165900.
Cf. numbers of the form n*(n*k-k+4)/2 listed in A226488.
Cf. A058331 and A247375. - Bruno Berselli, Sep 16 2014
Cf. A194715 (4-cycles in the triangular honeycomb obtuse knight graph), A290391 (5-cycles), A290392 (6-cycles). - Eric W. Weisstein, Jul 29 2017
Cf. A139098, A077591.
Cf. A000217, A002266.
Integers such that: this sequence (the number of even divisors is odd), A028982 (the number of odd divisors is odd), A028983 (the number of odd divisors is even), A183300 (the number of even divisors is even).

List([0..50],n->2*n^2); # Muniru A Asiru, Feb 24 2019

a001105 = a005843 . a000290  -- Reinhard Zumkeller, Dec 12 2012

[2*n^2: n in [0..50] ]; // Vincenzo Librandi, Apr 30 2011

A001105:=n->2*n^2; seq(A001105(k), k=0..100); # Wesley Ivan Hurt, Oct 29 2013

2 Range[0, 50]^2 (* Harvey P. Dale, Jan 23 2011 *)
LinearRecurrence[{3, -3, 1}, {2, 8, 18}, {0, 20}] (* Eric W. Weisstein, Jul 28 2017 *)
2 PolygonalNumber[4, Range[0, 20]] (* Eric W. Weisstein, Jul 28 2017 *)

a(n) = 2*n^2; \\ Charles R Greathouse IV, Jun 16 2011

def A001105(n): return n**2<<1 # Chai Wah Wu, Aug 04 2025

[2*n^2 for n in (0..20)] # G. C. Greubel, Feb 22 2019

a(n) = (-1)^(n+1) * A053120(2*n, 2).
G.f.: 2*x*(1+x)/(1-x)^3.
a(n) = A100345(n, n).
Sum_{n>=1} 1/a(n) = Pi^2/12 =A072691. [Jolley eq. 319]. - Gary W. Adamson, Dec 21 2006
a(n) = A049452(n) - A033991(n). - Zerinvary Lajos, Jun 12 2007
a(n) = A016742(n)/2. - Zerinvary Lajos, Jun 20 2008
a(n) = 2 * A000290(n). - Omar E. Pol, May 14 2008
a(n) = 4*n + a(n-1) - 2, n > 0. - Vincenzo Librandi
a(n) = A002378(n-1) + A002378(n). - Joerg M. Schuetze (joerg(AT)cyberheim.de), Mar 08 2010 [Corrected by Klaus Purath, Jun 18 2020]
a(n) = A176271(n,k) + A176271(n,n-k+1), 1 <= k <= n. - Reinhard Zumkeller, Apr 13 2010
a(n) = A007607(A000290(n)). - Reinhard Zumkeller, Feb 12 2011
For n > 0, a(n) = 1/coefficient of x^2 in the Maclaurin expansion of 1/(cos(x)+n-1). - Francesco Daddi, Aug 04 2011
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Artur Jasinski, Nov 24 2011
a(n) = A070216(n,n) for n > 0. - Reinhard Zumkeller, Nov 11 2012
a(n) = A014132(2*n-1,n) for n > 0. - Reinhard Zumkeller, Dec 12 2012
a(n) = A000217(n) + A000326(n). - Omar E. Pol, Jan 11 2013
(a(n) - A000217(k))^2  = A000217(2*n-1-k)*A000217(2*n+k) + n^2, for all k. - Charlie Marion, May 04 2013
a(n) = floor(1/(1-cos(1/n))), n > 0. - Clark Kimberling, Oct 08 2014
a(n) = A251599(3*n-1) for n > 0. - Reinhard Zumkeller, Dec 13 2014
a(n) = Sum_{j=1..n} Sum_{i=1..n} ceiling((i+j-n+4)/3). - Wesley Ivan Hurt, Mar 12 2015
a(n) = A002061(n+1) + A165900(n). - Torlach Rush, Feb 21 2019
E.g.f.: 2*exp(x)*x*(1 + x). - Stefano Spezia, Oct 12 2019
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/24 (A222171). - Amiram Eldar, Jul 03 2020
From Amiram Eldar, Feb 03 2021: (Start)
Product_{n>=1} (1 + 1/a(n)) = sqrt(2)*sinh(Pi/sqrt(2))/Pi.
Product_{n>=1} (1 - 1/a(n)) = sqrt(2)*sin(Pi/sqrt(2))/Pi. (End)

A058331 a(n) = 2*n^2 + 1.

Original entry on oeis.org

1, 3, 9, 19, 33, 51, 73, 99, 129, 163, 201, 243, 289, 339, 393, 451, 513, 579, 649, 723, 801, 883, 969, 1059, 1153, 1251, 1353, 1459, 1569, 1683, 1801, 1923, 2049, 2179, 2313, 2451, 2593, 2739, 2889, 3043, 3201, 3363, 3529, 3699, 3873, 4051

Offset: 0

Erich Friedman, Dec 12 2000

Maximal number of regions in the plane that can be formed with n hyperbolas.
Also the number of different 2 X 2 determinants with integer entries from 0 to n.
Number of lattice points in an n-dimensional ball of radius sqrt(2). - David W. Wilson, May 03 2001
Equals A112295(unsigned) * [1, 2, 3, ...]. - Gary W. Adamson, Oct 07 2007
Binomial transform of A166926. - Gary W. Adamson, May 03 2008
a(n) = longest side a of all integer-sided triangles with sides a <= b <= c and inradius n >= 1. Triangle has sides (2n^2 + 1, 2n^2 + 2, 4n^2 + 1).
{a(k): 0 <= k < 3} = divisors of 9. - Reinhard Zumkeller, Jun 17 2009
Number of ways to partition a 3*n X 2 grid into 3 connected equal-area regions. - R. H. Hardin, Oct 31 2009
Let A be the Hessenberg matrix of order n defined by: A[1, j] = 1, A[i, i] := 2, (i > 1), A[i, i - 1] = -1, and A[i, j] = 0 otherwise. Then, for n >= 3, a(n - 1) = coeff(charpoly(A, x), x^(n - 2)). - Milan Janjic, Jan 26 2010
Except for the first term of [A002522] and [A058331] if X = [A058331], Y = [A087113], A = [A002522], we have, for all other terms, Pell's equation: [A058331]^2 - [A002522]*[A087113]^2 = 1; (X^2 - A*Y^2 = 1); e.g., 3^2 -2*2^2 = 1; 9^2 - 5*4^2 = 1; 129^2 - 65*16^2 = 1, and so on. - Vincenzo Librandi, Aug 07 2010
Niven (1961) gives this formula as an example of a formula that does not contain all odd integers, in contrast to 2n + 1 and 2n - 1. - Alonso del Arte, Dec 05 2012
Numbers m such that 2*m-2 is a square. - Vincenzo Librandi, Apr 10 2015
Number of n-tuples from the set {1,0,-1} where at most two elements are nonzero. - Michael Somos, Oct 19 2022
a(n) gives the x-value of the integral solution (x,y) of the Pellian equation x^2 - (n^2 + 1)*y^2 = 1. The y-value is given by 2*n (see Tattersall). - Stefano Spezia, Jul 23 2025

			a(1) = 3 since (0 0 / 0 0), (1 0 / 0 1) and (0 1 / 1 0) have different determinants.
G.f. = 1 + 3*x + 9*x^2 + 19*x^3 + 33*x^4 + 51*x^5 + 73*x^6 + ... - _Michael Somos_, Oct 19 2022

Ivan Niven, Numbers: Rational and Irrational, New York: Random House for Yale University (1961): 17.
James J. Tattersall, Elementary Number Theory in Nine Chapters, Cambridge University Press, 1999, page 256.

G. C. Greubel, Table of n, a(n) for n = 0..5000
Steven Edwards and William Griffiths, On Generalized Delannoy Numbers, J. Int. Seq., Vol. 23 (2020), Article 20.3.6.
Milan Janjić, On Restricted Ternary Words and Insets, arXiv:1905.04465 [math.CO], 2019.
Clark Kimberling, Complementary Equations, Journal of Integer Sequences, Vol. 10 (2007), Article 07.1.4.
Leo Tavares, Illustration: Triangular Outlines
Reinhard Zumkeller, Enumerations of Divisors.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A000124.
Second row of array A099597.
See A120062 for sequences related to integer-sided triangles with integer inradius n.
Cf. A112295.
Cf. A087113, A002552.
Cf. A005408, A016813, A086514, A000125, A002522, A161701, A161702, A161703, A000127, A161704, A161706, A161707, A161708, A161710, A080856, A161711, A161712, A161713, A161715, A006261.
Cf. A001079, A037270, A071253, A108741, A132592, A146311, A146312, A146313, A173115, A173116, A173121.
Column 2 of array A188645.
Cf. A001105 and A247375. - Bruno Berselli, Sep 16 2014
Cf. A056106, A251599.
Cf. A000384, A000217, A166926.

a058331 = (+ 1) . a001105  -- Reinhard Zumkeller, Dec 13 2014

[2*n^2 + 1 : n in [0..100]]; // Wesley Ivan Hurt, Feb 02 2017

b[g_] := Length[Union[Map[Det, Flatten[ Table[{{i, j}, {k, l}}, {i, 0, g}, {j, 0, g}, {k, 0, g}, {l, 0, g}], 3]]]] Table[b[g], {g, 0, 20}]
2*Range[0, 49]^2 + 1 (* Alonso del Arte, Dec 05 2012 *)

a(n)=2*n^2+1 \\ Charles R Greathouse IV, Jun 16 2011

G.f.: (1 + 3x^2)/(1 - x)^3. - Paul Barry, Apr 06 2003
a(n) = M^n * [1 1 1], leftmost term, where M = the 3 X 3 matrix [1 1 1 / 0 1 4 / 0 0 1]. a(0) = 1, a(1) = 3; a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). E.g., a(4) = 33 since M^4 *[1 1 1] = [33 17 1]. - Gary W. Adamson, Nov 11 2004
a(n) = cosh(2*arccosh(n)). - Artur Jasinski, Feb 10 2010
a(n) = 4*n + a(n-1) - 2 for n > 0, a(0) = 1. - Vincenzo Librandi, Aug 07 2010
a(n) = (((n-1)^2 + n^2))/2 + (n^2 + (n+1)^2)/2. - J. M. Bergot, May 31 2012
a(n) = A251599(3*n) for n > 0. - Reinhard Zumkeller, Dec 13 2014
a(n) = sqrt(8*(A000217(n-1)^2 + A000217(n)^2) + 1). - J. M. Bergot, Sep 03 2015
E.g.f.: (2*x^2 + 2*x + 1)*exp(x). - G. C. Greubel, Jul 14 2017
a(n) = A002378(n) + A002061(n). - Bruce J. Nicholson, Aug 06 2017
From Amiram Eldar, Jul 15 2020: (Start)
Sum_{n>=0} 1/a(n) = (1 + (Pi/sqrt(2))*coth(Pi/sqrt(2)))/2.
Sum_{n>=0} (-1)^n/a(n) = (1 + (Pi/sqrt(2))*csch(Pi/sqrt(2)))/2. (End)
From Amiram Eldar, Feb 05 2021: (Start)
Product_{n>=0} (1 + 1/a(n)) = sqrt(2)*csch(Pi/sqrt(2))*sinh(Pi).
Product_{n>=1} (1 - 1/a(n)) = (Pi/sqrt(2))*csch(Pi/sqrt(2)). (End)
From Leo Tavares, May 23 2022: (Start)
a(n) = A000384(n+1) - 3*n.
a(n) = 3*A000217(n) + A000217(n-2). (End)
a(n) = a(-n) for all n in Z and A037235(n) = Sum_{k=0..n-1} a(k). - Michael Somos, Oct 19 2022

Revised description from Noam Katz (noamkj(AT)hotmail.com), Jan 28 2001

A055792 a(n) and floor(a(n)/2) are both squares; i.e., squares which remain squares when written in base 2 and last digit is removed.

Original entry on oeis.org

0, 1, 9, 289, 9801, 332929, 11309769, 384199201, 13051463049, 443365544449, 15061377048201, 511643454094369, 17380816062160329, 590436102659356801, 20057446674355970889, 681362750825443653409, 23146276081390728245001, 786292024016459316676609

Offset: 0

Henry Bottomley, Jul 14 2000

a(n) > 0 is a square such that a(n) - 1 is a product of powers. - Michel Lagneau, Feb 16 2012

			a(2) = 9 because 9 = 3^2 = 1001_2 and 100_2 = 4 = 2^2.

Charles R Greathouse IV, Table of n, a(n) for n = 0..654
M. F. Hasler, Truncated squares, OEIS wiki, Jan 16 2012
Giovanni Lucca, Integer Sequences and Circle Chains Inside a Circular Segment, Forum Geometricorum, Vol. 18 (2018), 47-55.
Giovanni Lucca, Circle chains inside the arbelos and integer sequences, Int'l J. Geom. (2023) Vol. 12, No. 1, 71-82.
Index to sequences related to truncating digits of squares.
Index entries for linear recurrences with constant coefficients, signature (35,-35,1).

Cf. A023110, A247375.

LinearRecurrence[{35, -35, 1}, {0, 1, 9, 289}, 25] (* Paolo Xausa, Jul 22 2024 *)

concat(0, Vec(-x*(9*x^2-26*x+1)/((x-1)*(x^2-34*x+1)) + O(x^100))) \\ Colin Barker, Sep 15 2014

is(n)=issquare(n) && issquare(n\2) \\ Charles R Greathouse IV, May 07 2015

a(n) = 34*a(n-1) - a(n-2) - 16 = A001541(n-1)^2 = 2*A001542(n-1)^2 + 1 = 8*A001110(n-1) + 1.
From Colin Barker, Sep 15 2014: (Start)
a(n) = 35*a(n-1) - 35*a(n-2) + a(n-3) for n > 3.
G.f.: -x*(9*x^2 - 26*x + 1) / ((x-1)*(x^2 - 34*x + 1)). (End)
a(n) = c*k^n + 1/2 + o(1) with k = 17+sqrt(288) = 33.97... and c = 17/4 - sqrt(18). - Charles R Greathouse IV, May 07 2015
a(n) = (4 + 2*(17 + 12*sqrt(2))^(1-n) + (34 - 24*sqrt(2))*(17 + 12*sqrt(2))^n)/8 for n > 0. - Colin Barker, Mar 02 2016

A213037 a(n) = n^2 - 2*floor(n/2)^2.

Original entry on oeis.org

0, 1, 2, 7, 8, 17, 18, 31, 32, 49, 50, 71, 72, 97, 98, 127, 128, 161, 162, 199, 200, 241, 242, 287, 288, 337, 338, 391, 392, 449, 450, 511, 512, 577, 578, 647, 648, 721, 722, 799, 800, 881, 882, 967, 968, 1057, 1058, 1151, 1152, 1249, 1250, 1351

Offset: 0

Clark Kimberling, Jun 06 2012

David Lovler, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A000290, A008794.
Cf. A247375.
Cf. A322630 (diagonal).

a[n_] := n^2 - 2 Floor[n/2]^2
Table[a[n], {n, 0, 90}]    (* A213037 *)
LinearRecurrence[{1,2,-2,-1,1},{0,1,2,7,8},60] (* Harvey P. Dale, Oct 06 2016 *)

a(n) = n^2 - 2*(n\2)^2; \\ Michel Marcus, May 25 2022

a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5).
G.f.: x*(1 + x + 3*x^2 - x^3)/((1 - x)^3*(1 + x)^2). [Corrected by Bruno Berselli, Sep 16 2014]
a(n) = A000290(n) - 2*A008794(n). - Michel Marcus, May 27 2022
E.g.f.: ((3*x + x^2)*cosh(x) + (-1 + x + x^2)*sinh(x))/2. - David Lovler, Jun 20 2022
Sum_{n>=1} 1/a(n) = Pi^2/12 - cot(Pi/sqrt(2))*Pi/(2*sqrt(2)) + 1/2. - Amiram Eldar, Sep 24 2022

A354594 a(n) = n^2 + 2*floor(n/2)^2.

Original entry on oeis.org

0, 1, 6, 11, 24, 33, 54, 67, 96, 113, 150, 171, 216, 241, 294, 323, 384, 417, 486, 523, 600, 641, 726, 771, 864, 913, 1014, 1067, 1176, 1233, 1350, 1411, 1536, 1601, 1734, 1803, 1944, 2017, 2166, 2243, 2400, 2481, 2646, 2731, 2904

Offset: 0

David Lovler, Jun 01 2022

The first bisection is A033581, the second bisection is A080859. - Bernard Schott, Jun 07 2022

David Lovler, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A000290, A008794, A033581, A080859, A247375.

Cf. A213037, A322744 (diagonal), A354595, A354596.

a[n_] := n^2 + 2 Floor[n/2]^2
Table[a[n], {n, 0, 90}]    (* A354594 *)
LinearRecurrence[{1, 2, -2, -1, 1}, {0, 1, 6, 11, 24}, 60]

PARI
```
a(n) = n^2 + 2*(n\2)^2;
```

a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), n >= 5.
a(n) = A000290(n) + 2*A008794(n).
G.f.: x*(1 + 5*x + 3*x^2 + 3*x^3)/((1 - x)^3*(1 + x)^2).
E.g.f.: (x*(1 + 3*x)*cosh(x) + (1 + 3*x + 3*x^2)*sinh(x))/2. - Stefano Spezia, Jun 07 2022

A354595 a(n) = n^2 + 4*floor(n/2)^2.

Original entry on oeis.org

0, 1, 8, 13, 32, 41, 72, 85, 128, 145, 200, 221, 288, 313, 392, 421, 512, 545, 648, 685, 800, 841, 968, 1013, 1152, 1201, 1352, 1405, 1568, 1625, 1800, 1861, 2048, 2113, 2312, 2381, 2592, 2665, 2888, 2965, 3200, 3281, 3528, 3613, 3872

Offset: 0

David Lovler, Jun 01 2022

The first bisection is A139098, the second bisection is A102083.

David Lovler, Table of n, a(n) for n = 0..10000
Index entries for linear recurrences with constant coefficients, signature (1,2,-2,-1,1).

Cf. A000290, A008794, A102083, A139098, A247375.

Cf. A213037, A327259 (diagonal), A354594, A354596.

a[n_] := n^2 + 4 Floor[n/2]^2
Table[a[n], {n, 0, 90}]    (* A354595 *)
LinearRecurrence[{1, 2, -2, -1, 1}, {0, 1, 8, 13, 32}, 60]

PARI
```
a(n) = n^2 + 4*(n\2)^2;
```

a(n) = a(n-1) + 2*a(n-2) - 2*a(n-3) - a(n-4) + a(n-5), n >= 5.
a(n) = A000290(n) + 4*A008794(n).
G.f.: x*(1 + 7*x + 3*x^2 + 5*x^3)/((1 - x)^3*(1 + x)^2).
E.g.f.: 2*x^2*cosh(x) + (1 + 2*x + 2*x^2)*sinh(x). - Stefano Spezia, Jun 07 2022

A354596 Array T(n,k) = k^2 + (2n-4)*floor(k/2)^2, n >= 0, k >= 0, read by descending antidiagonals.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 5, 2, 1, 0, 0, 7, 4, 1, 0, 9, 8, 9, 6, 1, 0, 0, 17, 16, 11, 8, 1, 0, 13, 18, 25, 24, 13, 10, 1, 0, 0, 31, 36, 33, 32, 15, 12, 1, 0, 17, 32, 49, 54, 41, 40, 17, 14, 1, 0, 0, 49, 64, 67, 72, 49, 48, 19, 16, 1, 0, 21, 50, 81, 96, 85, 90, 57, 56, 21, 18, 1, 0

Offset: 0

David Lovler, Jun 01 2022

Column k is an arithmetic progression with difference 2*A008794(k).
Odd rows of A133728 triangle are contained in row 0.
For i = 0 through 4, row i is 0 and the diagonal of A319929, A322630 = A213037, A003991, A322744, and A327259, respectively. In general, row i is 0 and the diagonal of array U(i;n,k) described in A327263.

			T(n,k) begins:
  0,   1,   0,   5,   0,   9,   0,  13, ...
  0,   1,   2,   7,   8,  17,  18,  31, ...
  0,   1,   4,   9,  16,  25,  36,  49, ...
  0,   1,   6,  11,  24,  33,  54,  67, ...
  0,   1,   8,  13,  32,  41,  72,  85, ...
  0,   1,  10,  15,  40,  49,  90, 103, ...
  0,   1,  12,  17,  48,  57, 108, 121, ...
  ...

David Lovler, Table of n, a(n) for n = 0..5150

Cf. A000290, A008794, A133728, A213037, A247375.
Cf. A266222, A266439.
Cf. A319929, A322630, A322744, A327259, A327263, A354594, A354595.

T[n_, k_] := k^2 + (2*n - 4)*Floor[k/2]^2; Table[T[n - k, k], {n, 0, 10}, {k, n, 0, -1}] // Flatten (* Amiram Eldar, Jun 20 2022 *)

PARI
```
T(n,k) = k^2 + (2*n-4)*(k\2)^2;
```

T(n,k) = U(n;k,k) (see A327263).
For each row, T(n,k) = T(n,k-1) + 2*T(n,k-2) - 2*T(n,k-3) - T(n,k-4) + T(n,k-5), k >= 5.
G.f. for row n: x*(1 + (2*n-1)*x + 3*x^2 + (2*n-3)*x^3)/((1 - x)^3*(1 + x)^2). When n = 2, this reduces to x*(1 + x)/(1 - x)^3.
E.g.f. for row n: (((4-n)*x + n*x^2)*cosh(x) + (n-2 + n*x + n*x^2)*sinh(x))/2. When n = 2, this reduces to (x + x^2)*cosh(x) + (x + x^2)*sinh(x) = (x + x^2)*exp(x).

A266069 Decimal representation of the n-th iteration of the "Rule 3" elementary cellular automaton starting with a single ON (black) cell.

Original entry on oeis.org

1, 4, 2, 121, 4, 2035, 8, 32743, 16, 524239, 32, 8388511, 64, 134217535, 128, 2147483263, 256, 34359737599, 512, 549755812351, 1024, 8796093019135, 2048, 140737488349183, 4096, 2251799813672959, 8192, 36028797018939391, 16384, 576460752303374335, 32768

Offset: 0

Robert Price, Dec 20 2015

Rule 35 also generates this sequence.

			From _Michael De Vlieger_, Dec 21 2015: (Start)
First 8 rows, replacing leading zeros with ".", the row converted to its binary, then decimal equivalent at right:
              1                =               1 ->     1
            1 0 0              =             100 ->     4
          . . . 1 0            =              10 ->     2
        1 1 1 1 0 0 1          =         1111001 ->   121
      . . . . . . 1 0 0        =             100 ->     4
    1 1 1 1 1 1 1 0 0 1 1      =     11111110011 ->  2035
  . . . . . . . . . 1 0 0 0    =            1000 ->     8
1 1 1 1 1 1 1 1 1 1 0 0 1 1 1  = 111111111100111 -> 32743
(End)

S. Wolfram, A New Kind of Science, Wolfram Media, 2002; p. 55.

Robert Price, Table of n, a(n) for n = 0..999
Eric Weisstein's World of Mathematics, Elementary Cellular Automaton
Index entries for sequences related to cellular automata
Index to Elementary Cellular Automata

Cf. A263428, A266068, A266070, A266071, A081253, A266072, A247375, A266073, A266074.

rule = 3; rows = 30; Table[FromDigits[Table[Take[CellularAutomaton[rule,{{1},0}, rows-1, {All,All}][[k]], {rows-k+1, rows+k-1}], {k,1,rows}][[k]],2], {k,1,rows}]

print([2*4**n - 3*2**((n-1)//2) - 1 if n%2 else 2**(n//2) for n in range(30)]) # Karl V. Keller, Jr., Aug 25 2021

G.f.: (1+4*x-17*x^2+45*x^3+16*x^4-64*x^5) / ((1-x)*(1+x)*(1-4*x)*(1+4*x)*(1-2*x^2)). - Colin Barker, Dec 21 2015 and Apr 18 2019

a(n) = 2*4^n - 3*2^((n-1)/2) - 1 for odd n; a(n) = 2^(n/2) for even n. - Karl V. Keller, Jr., Aug 25 2021

cp's OEIS Frontend

A001105 a(n) = 2*n^2.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

GAP

Haskell

Magma

Maple

Mathematica

PARI

Python

Sage

Formula

A058331 a(n) = 2*n^2 + 1.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

Extensions

A055792 a(n) and floor(a(n)/2) are both squares; i.e., squares which remain squares when written in base 2 and last digit is removed.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A213037 a(n) = n^2 - 2*floor(n/2)^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A354594 a(n) = n^2 + 2*floor(n/2)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A354595 a(n) = n^2 + 4*floor(n/2)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI