A077221 -id:A077221 - cp's OEIS frontend

A153641 Nonzero coefficients of the Swiss-Knife polynomials for the computation of Euler, tangent, and Bernoulli numbers (triangle read by rows).

1, 1, 1, -1, 1, -3, 1, -6, 5, 1, -10, 25, 1, -15, 75, -61, 1, -21, 175, -427, 1, -28, 350, -1708, 1385, 1, -36, 630, -5124, 12465, 1, -45, 1050, -12810, 62325, -50521, 1, -55, 1650, -28182, 228525, -555731, 1, -66, 2475, -56364, 685575, -3334386, 2702765, 1

Offset: 0

Peter Luschny, Dec 29 2008

In the following the expression [n odd] is 1 if n is odd, 0 otherwise.
(+) W_n(0) = E_n are the Euler (or secant) numbers A122045.
(+) W_n(1) = T_n are the signed tangent numbers, see A009006.
(+) W_{n-1}(1) n / (4^n - 2^n) = B_n gives for n > 1 the Bernoulli number A027641/A027642.
(+) W_n(-1) 2^{-n}(n+1) = G_n the Genocchi number A036968.
(+) W_n(1/2) 2^{n} are the signed generalized Euler (Springer) number, see A001586.
(+) | W_n([n odd]) | the number of alternating permutations A000111.
(+) | W_n([n odd]) / n! | for 0<=n the Euler zeta number A099612/A099617 (see Wikipedia on Bernoulli number). - Peter Luschny, Dec 29 2008
The diagonals in the full triangle (with zero coefficients) of the polynomials have the general form E(k)*binomial(n+k,k) (k>=0 fixed, n=0,1,...) where E(n) are the Euler numbers in the enumeration A122045. For k=2 we find the triangular numbers A000217 and for k=4 A154286. - Peter Luschny, Jan 06 2009
From Peter Bala, Jun 10 2009: (Start)
The Swiss-Knife polynomials W_n(x) may be expressed in terms of the Bernoulli polynomials B(n,x) as
... W_n(x) = 4^(n+1)/(2*n+2)*[B(n+1,(x+3)/4) - B(n+1,(x+1)/4)].
The Swiss-Knife polynomials are, apart from a multiplying factor, examples of generalized Bernoulli polynomials.
Let X be the Dirichlet character modulus 4 defined by X(4*n+1) = 1, X(4*n+3) = -1 and X(2*n) = 0. The generalized Bernoulli polynomials B(X;n,x), n = 1,2,..., associated with the character X are defined by means of the generating function
... t*exp(x*t)*(exp(t)-exp(3*t))/(exp(4*t)-1) = sum {n = 1..inf} B(X;n,x)*t^n/n!.
The first few values are B(X;1,x) = -1/2, B(X;2,x) = -x, B(X,3,x) = -3/2*(x^2-1) and B(X;4,x) = -2*(x^3-3*x).
In general, W_n(x) = -2/(n+1)*B(X;n+1,x).
For the theory of generalized Bernoulli polynomials associated to a periodic arithmetical function see [Cohen, Section 9.4].
The generalized Bernoulli polynomials may be used to evaluate twisted sums of k-th powers. For the present case the result is
sum{n = 0..4*N-1} X(n)*n^k = 1^k - 3^k + 5^k - 7^k + ... - (4*N-1)^k
= [B(X;k+1,4*N) - B(X;k+1,0)]/(k+1) = [W_k(0) - W_k(4*N)]/2.
For the proof apply [Cohen, Corollary 9.4.17 with m = 4 and x = 0].
The generalized Bernoulli polynomials and the Swiss-Knife polynomials are also related to infinite sums of powers through their Fourier series - see the formula section below. For a table of the coefficients of generalized Bernoulli polynomials attached to a Dirichlet character modulus 8 see A151751.
(End)
The Swiss-Knife polynomials provide a general formula for alternating sums of powers similar to the formula which are provided by the Bernoulli polynomials for non-alternating sums of powers (see the Luschny link). Sequences covered by this formula include A001057, A062393, A062392, A011934, A144129, A077221, A137501, A046092. - Peter Luschny, Jul 12 2009
The greatest common divisor of the nonzero coefficients of the decapitated Swiss-Knife polynomials is exp(Lambda(n)), where Lambda(n) is the von Mangoldt function for odd primes, symbolically:
gcd(coeffs(SKP_{n}(x) - x^n)) = A155457(n) (n>1). - Peter Luschny, Dec 16 2009
Another version is at A119879. - Philippe Deléham, Oct 26 2013

			1
x
x^2  -1
x^3  -3x
x^4  -6x^2   +5
x^5 -10x^3  +25x
x^6 -15x^4  +75x^2  -61
x^7 -21x^5 +175x^3 -427x

H. Cohen, Number Theory - Volume II: Analytic and Modern Tools, Graduate Texts in Mathematics. Springer-Verlag. [From Peter Bala, Jun 10 2009]

G. C. Greubel, Table of n, a(n) for the first 76 rows, flattened
Ayse Yilmaz Ceylan and Yilmaz Simsek, Formulae for Generalization of Touchard Polynomials with Their Generating Functions, Symmetry (2025) Vol. 17, Issue 7, Art. No. 1126. See Eq. 28 and after.
Kwang-Wu Chen, Algorithms for Bernoulli numbers and Euler numbers, J. Integer Sequences, 4 (2001), #01.1.6.
Suyoung Choi and Hanchul Park, A new graph invariant arises in toric topology, arXiv preprint arXiv:1210.3776 [math.AT], 2012.
Leonhard Euler (1735), De summis serierum reciprocarum, Opera Omnia I.14, E 41, 73-86; On the sums of series of reciprocals, arXiv:math/0506415 [math.HO], 2005-2008.
A. Hodges and C. V. Sukumar, Bernoulli, Euler, permutations and quantum algebras, Proc. R. Soc. A Oct. 2007 vol 463 no. 463 2086 2401-2414. [Added by Tom Copeland, Aug 31 2015]
Peter Luschny, The Swiss-Knife polynomials.
Peter Luschny, Swiss-Knife polynomials and Euler numbers
Wikipedia, Bernoulli number
J. Worpitzky, Studien über die Bernoullischen und Eulerschen Zahlen, Journal für die reine und angewandte Mathematik, 94 (1883), 203-232.

Cf. A151751, A162590, A000111, A001586, A009006, A027641/A027642, A036968, A099612/A099617, A119879, A104033.
W_n(k), k=0,1,...
W_0:  1,  1,  1,  1,   1,   1, ........ A000012
W_1:  0,  1,  2,  3,   4,   5, ........ A001477
W_2: -1,  0,  3,  8,  15,  24, ........ A067998
W_3:  0, -2,  2, 18,  52, 110, ........ A121670
W_4:  5,  0, -3, 32, 165, 480, ........
W_n(k), n=0,1,...
k=0:  1,  0, -1,  0,   5,   0, -61, ... A122045
k=1:  1,  1,  0, -2,   0,  16,   0, ... A155585
k=2:  1,  2,  3,  2,  -3,   2,  63, ... A119880
k=3:  1,  3,  8, 18,  32,  48, 128, ... A119881
k=4:  1,  4, 15, 52, 165, 484, ........         [Peter Luschny, Jul 07 2009]

w := proc(n,x) local v,k,pow,chen; pow := (a,b) -> if a = 0 and b = 0 then 1 else a^b fi; chen := proc(m) if irem(m+1,4) = 0 then RETURN(0) fi; 1/((-1)^iquo(m+1,4) *2^iquo(m,2)) end; add(add((-1)^v*binomial(k,v)*pow(v+x+1,n)*chen(k),v=0..k), k=0..n) end:
# Coefficients with zeros:
seq(print(seq(coeff(i!*coeff(series(exp(x*t)*sech(t),t,16),t,i),x,i-n),n=0..i)), i=0..8);
# Recursion
W := proc(n,z) option remember; local k,p;
if n = 0 then 1 else p := irem(n+1,2);
z^n - p + add(`if`(irem(k,2)=1,0,
W(k,0)*binomial(n,k)*(power(z,n-k)-p)),k=2..n-1) fi end:
# Peter Luschny, edited and additions Jul 07 2009, May 13 2010, Oct 24 2011

max = 9; rows = (Reverse[ CoefficientList[ #, x]] & ) /@ CoefficientList[ Series[ Exp[x*t]*Sech[t], {t, 0, max}], t]*Range[0, max]!; par[coefs_] := (p = Partition[ coefs, 2][[All, 1]]; If[ EvenQ[ Length[ coefs]], p, Append[ p, Last[ coefs]]]); Flatten[ par /@ rows] (* Jean-François Alcover, Oct 03 2011, after g.f. *)
sk[n_, x_] := Sum[Binomial[n, k]*EulerE[k]*x^(n-k), {k, 0, n}]; Table[CoefficientList[sk[n, x], x] // Reverse // Select[#, # =!= 0 &] &, {n, 0, 13}] // Flatten (* Jean-François Alcover, May 21 2013 *)
Flatten@Table[Binomial[n, 2k] EulerE[2k], {n, 0, 12}, {k, 0, n/2}](* Oliver Seipel, Jan 14 2025 *)

def A046978(k):
    if k % 4 == 0:
        return 0
    return (-1)**(k // 4)
def A153641_poly(n, x):
    return expand(add(2**(-(k // 2))*A046978(k+1)*add((-1)**v*binomial(k,v)*(v+x+1)**n for v in (0..k)) for k in (0..n)))
for n in (0..7): print(A153641_poly(n, x))  # Peter Luschny, Oct 24 2011

W_n(x) = Sum_{k=0..n}{v=0..k} (-1)^v binomial(k,v)*c_k*(x+v+1)^n where c_k = frac((-1)^(floor(k/4))/2^(floor(k/2))) [4 not div k] (Iverson notation).
From Peter Bala, Jun 10 2009: (Start)
E.g.f.: 2*exp(x*t)*(exp(t)-exp(3*t))/(1-exp(4*t))= 1 + x*t + (x^2-1)*t^2/2! + (x^3-3*x)*t^3/3! + ....
W_n(x) = 1/(2*n+2)*Sum_{k=0..n+1} 1/(k+1)*Sum_{i=0..k} (-1)^i*binomial(k,i)*((x+4*i+3)^(n+1) - (x+4*i+1)^(n+1)).
Fourier series expansion for the generalized Bernoulli polynomials:
B(X;2*n,x) = (-1)^n*(2/Pi)^(2*n)*(2*n)! * {sin(Pi*x/2)/1^(2*n) - sin(3*Pi*x/2)/3^(2*n) + sin(5*Pi*x/2)/5^(2*n) - ...}, valid for 0 <= x <= 1 when n >= 1.
B(X;2*n+1,x) = (-1)^(n+1)*(2/Pi)^(2*n+1)*(2*n+1)! * {cos(Pi*x/2)/1^(2*n+1) - cos(3*Pi*x/2)/3^(2*n+1) + cos(5*Pi*x/2)/5^(2*n+1) - ...}, valid for 0 <= x <= 1 when n >= 1 and for 0 <= x < 1 when n = 0.
(End)
E.g.f.: exp(x*t) * sech(t). - Peter Luschny, Jul 07 2009
O.g.f. as a J-fraction: z/(1-x*z+z^2/(1-x*z+4*z^2/(1-x*z+9*z^2/(1-x*z+...)))) = z + x*z^2 + (x^2-1)*z^3 + (x^3-3*x)*z^4 + .... - Peter Bala, Mar 11 2012
Conjectural o.g.f.: Sum_{n >= 0} (1/2^((n-1)/2))*cos((n+1)*Pi/4)*( Sum_{k = 0..n} (-1)^k*binomial(n,k)/(1 - (k + x)*t) ) = 1 + x*t + (x^2 - 1)*t^2 + (x^3 - 3*x)*t^3 + ... (checked up to O(t^13)), which leads to W_n(x) = Sum_{k = 0..n} 1/2^((k - 1)/2)*cos((k + 1)*Pi/4)*( Sum_{j = 0..k} (-1)^j*binomial(k, j)*(j + x)^n ). - Peter Bala, Oct 03 2016

A069129 Centered 16-gonal numbers.

Original entry on oeis.org

1, 17, 49, 97, 161, 241, 337, 449, 577, 721, 881, 1057, 1249, 1457, 1681, 1921, 2177, 2449, 2737, 3041, 3361, 3697, 4049, 4417, 4801, 5201, 5617, 6049, 6497, 6961, 7441, 7937, 8449, 8977, 9521, 10081, 10657, 11249, 11857, 12481, 13121, 13777, 14449, 15137, 15841

Offset: 1

Terrel Trotter, Jr., Apr 07 2002

Also, sequence found by reading the line from 1, in the direction 1, 17, ..., in the square spiral whose vertices are the triangular numbers A000217. Opposite numbers to the members of A139098 in the same spiral. - Omar E. Pol, Apr 26 2008
The subsequence of primes begins: 17, 97, 241, 337, 449, 577, 881, 1249, 3041, 3361, 3697, 4049, 4801, 6961, 7937, 9521,  10657, 13121, 14449. See A184899: n such that the n-th centered 12-gonal number is prime. Indices of prime star numbers. - Jonathan Vos Post, Feb 27 2011
Binomial transform of [1, 16, 16, 0, 0, 0, ...] and Narayana transform (A001263) of [1, 16, 0, 0, 0, ...]. - Gary W. Adamson, Jul 28 2011
Centered hexadecagonal numbers or centered hexakaidecagonal numbers. - Omar E. Pol, Oct 03 2011
a(n) = m(n,n) for an array constructed by using the terms in A016813 as the antidiagonals; the first few antidiagonals are 1; 5,9; 13,17,21; 25,29,33,37. - J. M. Bergot, Jul 05 2013
[The first five rows begin: 1,9,21,37,57; 5,17,33,53,77; 13,29,49,73,101; 25,45,69,97,129; 41,65,93,125,161.]

			a(5) = 161 because 8*5^2 - 8*5 + 1 = 200 - 40 + 1 = 161.

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Omar E. Pol, Determinacion geometrica de los numeros primos y perfectos.
Leo Tavares, Illustration: Octagonal Stars.
Eric Weisstein's World of Mathematics, Centered Polygonal Numbers.
R. Yin, J. Mu, and T. Komatsu, The p-Frobenius Number for the Triple of the Generalized Star Numbers, Preprints 2024, 2024072280. See p. 2.
Index entries for sequences related to centered polygonal numbers.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A005448, A001844, A005891, A003215, A069099, A000217, A035008, A139098.

Bisection of A077221.

[8*n^2-8*n+1: n in [0..50]]; // Vincenzo Librandi, Feb 05 2013

FoldList[#1 + #2 &, 1, 16 Range@ 45] (* Robert G. Wilson v, Feb 02 2011 *)
Rest[CoefficientList[Series[-x(1+14x+x^2)/(x-1)^3,{x,0,50}],x]]  (* Harvey P. Dale, Apr 22 2011 *)

a(n)=8*n^2-8*n+1 \\ Charles R Greathouse IV, Sep 24 2015

a(n) = 8*n^2 - 8*n + 1.
a(n) = A035008(n-1) + 1. - Omar E. Pol, Apr 26 2008
a(n) = 16*n + a(n-1) - 16 with n > 1, a(1)=1. - Vincenzo Librandi, Aug 08 2010
G.f.: -x*(1+14*x+x^2) / (x-1)^3. - R. J. Mathar, Feb 04 2011
E.g.f.: (8*x^2 + 1)*exp(x). - G. C. Greubel, Jul 18 2017
a(n) = A056220(2n-1). - Bruce J. Nicholson, Aug 31 2017
Sum_{n>=1} 1/a(n) = Pi * tan(Pi/(2*sqrt(2))) / (4*sqrt(2)). - Vaclav Kotesovec, Jul 23 2019
From Amiram Eldar, Jun 21 2020: (Start)
Sum_{n>=1} a(n)/n! = 9*e - 1.
Sum_{n>=1} (-1)^n * a(n)/n! = 9/e - 1. (End)
Product_{n>=2} (a(n) - 1) / (a(n) + 1) = Pi/4. - Dimitris Valianatos, Jun 27 2020
a(n) = A016754(n-1) + 8*A000217(n-1). - Leo Tavares, Jul 19 2021

A047522 Numbers that are congruent to {1, 7} mod 8.

Original entry on oeis.org

1, 7, 9, 15, 17, 23, 25, 31, 33, 39, 41, 47, 49, 55, 57, 63, 65, 71, 73, 79, 81, 87, 89, 95, 97, 103, 105, 111, 113, 119, 121, 127, 129, 135, 137, 143, 145, 151, 153, 159, 161, 167, 169, 175, 177, 183, 185, 191, 193, 199, 201, 207, 209, 215, 217, 223, 225, 231, 233

Offset: 1

N. J. A. Sloane

Also n such that Kronecker(2,n) = mu(gcd(2,n)). - Jon Perry and T. D. Noe, Jun 13 2003
Also n such that x^2 == 2 (mod n) has a solution. The primes are given in sequence A001132. - T. D. Noe, Jun 13 2003
As indicated in the formula, a(n) is related to the even triangular numbers. - Frederick Magata (frederick.magata(AT)uni-muenster.de), Jun 17 2004
Cf. property described by Gary Detlefs in A113801: more generally, these a(n) are of the form (2*h*n + (h-4)*(-1)^n-h)/4 (h,n natural numbers). Therefore a(n)^2 - 1 == 0 (mod h); in this case, a(n)^2 - 1 == 0 (mod 8). Also a(n)^2 - 1 == 0 (mod 16). - Bruno Berselli, Nov 17 2010
A089911(3*a(n)) = 2. - Reinhard Zumkeller, Jul 05 2013
S(a(n+1)/2, 0) = (1/2)*(S(a(n+1), sqrt(2)) - S(a(n+1) - 2, sqrt(2)))  = T(a(n+1), sqrt(2)/2) = cos(a(n+1)*Pi/4) = sqrt(2)/2 = A010503, identically for n >= 0, where S is the Chebyshev polynomial (A049310) here extended to fractional n, evaluated at x = 0. (For T see A053120.) - Wolfdieter Lang, Jun 04 2023

L. B. W. Jolley, Summation of Series, Dover Publications, 1961, p. 16.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A001132, A014494, A056575, A010709, A074378, A047336, A056020, A005408, A047209, A007310, A090771, A175885, A091998, A175886, A175887, A058529, A047621, A179260, A352125.
Cf. A077221 (partial sums).
Cf. A000217, A089911, A113801.
Cf. A010503, A049310, A053120.

a047522 n = a047522_list !! (n-1)
a047522_list = 1 : 7 : map (+ 8) a047522_list
-- Reinhard Zumkeller, Jan 07 2012

Select[Range[1, 191, 2], JacobiSymbol[2, # ]==1&]

a(n)=4*n-2+(-1)^n \\ Charles R Greathouse IV, Sep 24 2015

a(n) = sqrt(8*A014494(n)+1) = sqrt(16*ceiling(n/2)*(2*n+1)+1) = sqrt(8*A056575(n)-8*(2n+1)*(-1)^n+1). - Frederick Magata (frederick.magata(AT)uni-muenster.de), Jun 17 2004
1 - 1/7 + 1/9 - 1/15 + 1/17 - ... = (Pi/8)*(1 + sqrt(2)). [Jolley] - Gary W. Adamson, Dec 16 2006
From R. J. Mathar, Feb 19 2009: (Start)
a(n) = 4n - 2 + (-1)^n = a(n-2) + 8.
G.f.: x(1+6x+x^2)/((1+x)(1-x)^2). (End)
a(n) = 8*n - a(n-1) - 8. - Vincenzo Librandi, Aug 06 2010
From Bruno Berselli, Nov 17 2010: (Start)
a(n) = -a(-n+1) = a(n-1) + a(n-2) - a(n-3).
a(n) = 8*A000217(n-1)+1 - 2*Sum_{i=1..n-1} a(i) for n > 1. (End)
E.g.f.: 1 + (4*x - 1)*cosh(x) + (4*x - 3)*sinh(x). - Stefano Spezia, May 13 2021
E.g.f.: 1 + (4*x - 3)*exp(x) + 2*cosh(x). - David Lovler, Jul 16 2022
From Amiram Eldar, Nov 22 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = sqrt(2+sqrt(2)) (A179260).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/8)*cosec(Pi/8) (A352125). (End)

A195040 Square array read by antidiagonals with T(n,k) = kn^2/4+(k-4)((-1)^n-1)/8, n>=0, k>=0.

Original entry on oeis.org

0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 3, 2, 1, 0, 1, 4, 5, 3, 1, 0, 0, 7, 8, 7, 4, 1, 0, 1, 9, 13, 12, 9, 5, 1, 0, 0, 13, 18, 19, 16, 11, 6, 1, 0, 1, 16, 25, 27, 25, 20, 13, 7, 1, 0, 0, 21, 32, 37, 36, 31, 24, 15, 8, 1, 0, 1, 25, 41, 48, 49, 45, 37, 28, 17, 9, 1, 0

Offset: 0

Omar E. Pol, Sep 27 2011

Also, if k >= 2 and m = 2*k, then column k lists the numbers of the form k*n^2 and the centered m-gonal numbers interleaved.
For k >= 3, this is also a table of concentric polygonal numbers. Column k lists the concentric k-gonal numbers.
It appears that the first differences of column k are the numbers that are congruent to {1, k-1} mod k, if k >= 3.

			Array begins:
  0,   0,   0,   0,   0,   0,   0,   0,   0,   0, ...
  1,   1,   1,   1,   1,   1,   1,   1,   1,   1, ...
  0,   1,   2,   3,   4,   5,   6,   7,   8,   9, ...
  1,   3,   5,   7,   9,  11,  13,  15,  17,  19, ...
  0,   4,   8,  12,  16,  20,  24,  28,  32,  36, ...
  1,   7,  13,  19,  25,  31,  37,  43,  49,  55, ...
  0,   9,  18,  27,  36,  45,  54,  63,  72,  81, ...
  1,  13,  25,  37,  49,  61,  73,  85,  97, 109, ...
  0,  16,  32,  48,  64,  80,  96, 112, 128, 144, ...
  1,  21,  41,  61,  81, 101, 121, 141, 161, 181, ...
  0,  25,  50,  75, 100, 125, 150, 175, 200, 225, ...
  ...

Muniru A Asiru, Rows n=0..100, flattened

Rows n: A000004 (n=0), A000012 (n=1), A001477 (n=2), A005408 (n=3), A008586 (n=4), A016921 (n=5), A008591 (n=6), A017533 (n=7), A008598 (n=8), A215145 (n=9), A008607 (n=10).

Columns k: A000035 (k=0), A004652 (k=1), A000982 (k=2), A077043 (k=3), A000290 (k=4), A032527 (k=5), A032528 (k=6), A195041 (k=7), A077221 (k=8), A195042 (k=9), A195142 (k=10), A195043 (k=11), A195143 (k=12), A195045 (k=13), A195145 (k=14), A195046 (k=15), A195146 (k=16), A195047 (k=17), A195147 (k=18), A195048 (k=19), A195148 (k=20), A195049 (k=21), A195149 (k=22), A195058 (k=23), A195158 (k=24).

nmax:=13;; T:=List([0..nmax],n->List([0..nmax],k->k*n^2/4+(k-4)*((-1)^n-1)/8));; b:=List([2..nmax],n->OrderedPartitions(n,2));;
a:=Flat(List([1..Length(b)],i->List([1..Length(b[i])],j->T[b[i][j][2]][b[i][j][1]]))); # Muniru A Asiru, Jul 19 2018

A195040 := proc(n,k)
        k*n^2/4+((-1)^n-1)*(k-4)/8 ;
end proc:
for d from 0 to 12 do
        for k from 0 to d do
                printf("%d,",A195040(d-k,k)) ;
        end do:
end do; # R. J. Mathar, Sep 28 2011

t[n_, k_] := k*n^2/4+(k-4)*((-1)^n-1)/8; Flatten[ Table[ t[n-k, k], {n, 0, 11}, {k, 0, n}]] (* Jean-François Alcover, Dec 14 2011 *)

A195143 a(n) = n-th concentric 12-gonal number.

Original entry on oeis.org

0, 1, 12, 25, 48, 73, 108, 145, 192, 241, 300, 361, 432, 505, 588, 673, 768, 865, 972, 1081, 1200, 1321, 1452, 1585, 1728, 1873, 2028, 2185, 2352, 2521, 2700, 2881, 3072, 3265, 3468, 3673, 3888, 4105, 4332, 4561, 4800, 5041, 5292, 5545, 5808, 6073, 6348

Offset: 0

Omar E. Pol, Sep 17 2011

Concentric dodecagonal numbers. [corrected by Ivan Panchenko, Nov 09 2013]
Sequence found by reading the line from 0, in the direction 0, 12,..., and the same line from 1, in the direction 1, 25,..., in the square spiral whose vertices are the generalized octagonal numbers A001082. Main axis, perpendicular to A028896 in the same spiral.
Partial sums of A091998. - Reinhard Zumkeller, Jan 07 2012
Column 12 of A195040. - Omar E. Pol, Sep 28 2011

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

A135453 and A069190 interleaved.
Cf. A001082, A032527, A032528, A077221, A195043, A195045, A195040, A195142, A195145, A195146, A195147, A195148, A195149.
Cf. A016921 (6n+1), A016969 (6n+5), A091998 (positive integers of the form 12*k +- 1), A092242 (positive integers of the form 12*k +- 5).

a195143 n = a195143_list !! n
a195143_list = scanl (+) 0 a091998_list
-- Reinhard Zumkeller, Jan 07 2012

[(3*n^2+(-1)^n-1): n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

Table[Sum[2*(-1)^(n - k + 1) + 6*k - 3, {k, n}], {n, 0, 47}] (* L. Edson Jeffery, Sep 14 2014 *)

From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = 3*n^2+(-1)^n-1.
a(n) = -a(n-1) + 6*n^2 - 6*n + 1. (End)
G.f.: -x*(1+10*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
a(n) = Sum_{k=1..n} (2*(-1)^(n-k+1) + 3*(2*k-1)), n>0, a(0) = 0. - L. Edson Jeffery, Sep 14 2014
Sum_{n>=1} 1/a(n) = Pi^2/72 + tan(Pi/sqrt(6))*Pi/(4*sqrt(6)). - Amiram Eldar, Jan 16 2023

A195145 Concentric 14-gonal numbers.

Original entry on oeis.org

0, 1, 14, 29, 56, 85, 126, 169, 224, 281, 350, 421, 504, 589, 686, 785, 896, 1009, 1134, 1261, 1400, 1541, 1694, 1849, 2016, 2185, 2366, 2549, 2744, 2941, 3150, 3361, 3584, 3809, 4046, 4285, 4536, 4789, 5054, 5321, 5600, 5881, 6174, 6469, 6776, 7085, 7406

Offset: 0

Omar E. Pol, Sep 17 2011

Also concentric tetradecagonal numbers or concentric tetrakaidecagonal numbers. Also sequence found by reading the line from 0, in the direction 0, 14, ..., and the same line from 1, in the direction 1, 29, ..., in the square spiral whose vertices are the generalized enneagonal numbers A118277. Main axis, perpendicular to A024966 in the same spiral.

Partial sums of A113801. - Reinhard Zumkeller, Jan 07 2012

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

A144555 and A195314 interleaved.
Cf. A024966, A032527, A032528, A077221, A113801, A195045, A195046, A195142, A195143, A195146, A195147, A195148, A195149.
Column 14 of A195040. - Omar E. Pol, Sep 28 2011

a195145 n = a195145_list !! n
a195145_list = scanl (+) 0 a113801_list
-- Reinhard Zumkeller, Jan 07 2012

[(14*n^2+5*(-1)^n-5)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

LinearRecurrence[{2, 0, -2, 1}, {0, 1, 14, 29}, 50] (* Amiram Eldar, Jan 16 2023 *)

G.f.: -x*(1+12*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = (14*n^2 + 5*(-1)^n - 5)/4;
a(n) = a(-n) = -a(n-1) + 7*n^2 - 7*n + 1. (End)
Sum_{n>=1} 1/a(n) = Pi^2/84 + tan(sqrt(5/7)*Pi/2)*Pi/(2*sqrt(35)). - Amiram Eldar, Jan 16 2023
E.g.f.: (7*x*(x + 1)*cosh(x) + (7*x^2 + 7*x - 5)*sinh(x))/2. - Stefano Spezia, Nov 30 2024

A195149 Concentric 22-gonal numbers.

Original entry on oeis.org

0, 1, 22, 45, 88, 133, 198, 265, 352, 441, 550, 661, 792, 925, 1078, 1233, 1408, 1585, 1782, 1981, 2200, 2421, 2662, 2905, 3168, 3433, 3718, 4005, 4312, 4621, 4950, 5281, 5632, 5985, 6358, 6733, 7128, 7525, 7942, 8361, 8800, 9241, 9702, 10165, 10648, 11133

Offset: 0

Omar E. Pol, Sep 17 2011

Sequence found by reading the line from 0, in the direction 0, 22,..., and the same line from 1, in the direction 1, 45,..., in the square spiral whose vertices are the generalized tridecagonal numbers A195313. Main axis, perpendicular to A152740 in the same spiral.

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

A195323 and A195318 interleaved.
Cf. A032528, A077221, A195142, A195143, A195145, A195146, A195147, A195148.
Cf. A032527, A195049, A195058. Column 22 of A195040. - Omar E. Pol, Sep 29 2011

[(22*n^2+9*(-1)^n-9)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

A195149:=n->(22*n^2+9*(-1)^n-9)/4: seq(A195149(n), n=0..50); # Wesley Ivan Hurt, Jul 07 2014

Table[(22*n^2 + 9*(-1)^n - 9)/4, {n, 0, 50}] (* Wesley Ivan Hurt, Jul 07 2014 *)

a(n)=(22*n^2+9*(-1)^n-9)/4 \\ Charles R Greathouse IV, Sep 24 2015

G.f.: -x*(1+20*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
a(n) = (22*n^2+9*(-1)^n-9)/4; a(n) = -a(n-1)+11*n^2-11*n+1. - Vincenzo Librandi, Sep 27 2011
Sum_{n>=1} 1/a(n) = Pi^2/132 + tan(3*Pi/(2*sqrt(11)))*Pi/(6*sqrt(11)). - Amiram Eldar, Jan 17 2023
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4). - Wesley Ivan Hurt, Jun 19 2025

A195142 Concentric 10-gonal numbers.

Original entry on oeis.org

0, 1, 10, 21, 40, 61, 90, 121, 160, 201, 250, 301, 360, 421, 490, 561, 640, 721, 810, 901, 1000, 1101, 1210, 1321, 1440, 1561, 1690, 1821, 1960, 2101, 2250, 2401, 2560, 2721, 2890, 3061, 3240, 3421, 3610, 3801, 4000, 4201, 4410, 4621, 4840, 5061, 5290

Offset: 0

Omar E. Pol, Sep 17 2011

Also concentric decagonal numbers. Also sequence found by reading the line from 0, in the direction 0, 10, ..., and the same line from 1, in the direction 1, 21, ..., in the square spiral whose vertices are the generalized heptagonal numbers A085787. Main axis, perpendicular to A028895 in the same spiral.

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

A033583 and A069133 interleaved.
Cf. A028895, A032527, A032528, A077221, A085787, A195042, A195143, A195145, A195146, A195147, A195148, A195149.
Cf. A090771 (first differences).
Column 10 of A195040. - Omar E. Pol, Sep 28 2011

a195142 n = a195142_list !! n
a195142_list = scanl (+) 0 a090771_list
-- Reinhard Zumkeller, Jan 07 2012

[(10*n^2+3*(-1)^n-3)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

RecurrenceTable[{a[0]==0,a[1]==1,a[n]==a[n-2]+10(n-1)},a[n],{n,50}] (* or *) LinearRecurrence[{2,0,-2,1},{0,1,10,21},50] (* Harvey P. Dale, Sep 29 2011 *)

G.f.: -x*(1+8*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
a(n) = -a(n-1) + 5*n^2 - 5*n + 1, a(0)=0. - Vincenzo Librandi, Sep 27 2011
From Bruno Berselli, Sep 27 2011: (Start)
a(n) = a(-n) = (10*n^2 + 3*(-1)^n - 3)/4.
a(n) = a(n-2) + 10*(n-1). (End)
a(n) = 2*a(n-1) + 0*a(n-2) - 2*a(n-3) + a(n-4); a(0)=0, a(1)=1, a(2)=10, a(3)=21. - Harvey P. Dale, Sep 29 2011
Sum_{n>=1} 1/a(n) = Pi^2/60 + tan(sqrt(3/5)*Pi/2)*Pi/(2*sqrt(15)). - Amiram Eldar, Jan 16 2023

A195146 Concentric 16-gonal numbers.

Original entry on oeis.org

0, 1, 16, 33, 64, 97, 144, 193, 256, 321, 400, 481, 576, 673, 784, 897, 1024, 1153, 1296, 1441, 1600, 1761, 1936, 2113, 2304, 2497, 2704, 2913, 3136, 3361, 3600, 3841, 4096, 4353, 4624, 4897, 5184, 5473, 5776, 6081, 6400, 6721, 7056, 7393, 7744, 8097, 8464

Offset: 0

Omar E. Pol, Sep 17 2011

Concentric hexadecagonal numbers or concentric hexakaidecagonal numbers.

Sequence found by reading the line from 0, in the direction 0, 16, ..., and the same line from 1, in the direction 1, 33, ..., in the square spiral whose vertices are the generalized decagonal numbers A074377. Main axis, perpendicular to A033996 in the same spiral.

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

A016802 and A195315 interleaved.
Cf. A032528, A033996, A074377, A077221, A195142, A195143, A195145, A195147, A195148, A195149.
Column 16 of A195040.

[(8*n^2+3*(-1)^n-3)/2: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

LinearRecurrence[{2, 0, -2, 1}, {0, 1, 16, 33}, 50] (* Amiram Eldar, Jan 16 2023 *)

a(n)=(8*n^2+3*(-1)^n-3)/2 \\ Charles R Greathouse IV, Oct 07 2015

From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = (8*n^2 + 3*(-1)^n - 3)/2;
a(n) = -a(n-1) + 8*n^2 - 8*n + 1. (End)
G.f. -x*(1+14*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
Sum_{n>=1} 1/a(n) = Pi^2/96 + tan(sqrt(3)*Pi/4)*Pi/(8*sqrt(3)). - Amiram Eldar, Jan 16 2023

A195147 Concentric 18-gonal numbers.

Original entry on oeis.org

0, 1, 18, 37, 72, 109, 162, 217, 288, 361, 450, 541, 648, 757, 882, 1009, 1152, 1297, 1458, 1621, 1800, 1981, 2178, 2377, 2592, 2809, 3042, 3277, 3528, 3781, 4050, 4321, 4608, 4897, 5202, 5509, 5832, 6157, 6498, 6841, 7200, 7561, 7938, 8317, 8712, 9109

Offset: 0

Omar E. Pol, Sep 17 2011

Concentric octadecagonal numbers or concentric octakaidecagonal numbers.

Sequence found by reading the line from 0, in the direction 0, 18, ..., and the same line from 1, in the direction 1, 37, ..., in the square spiral whose vertices are the generalized hendecagonal numbers A195160. Main axis, perpendicular to A027468 in the same spiral.

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

A195321 and A195316 interleaved.
Cf. A032528, A077221, A195142, A195143, A195145, A195146, A195148, A195149.
Cf. A032527, A195047, A195048. Column 18 of A195040. - Omar E. Pol, Sep 29 2011

[(18*n^2+7*(-1)^n-7)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011

LinearRecurrence[{2, 0, -2, 1}, {0, 1, 18, 37}, 50] (* Amiram Eldar, Jan 17 2023 *)

a(n)=(18*n^2+7*(-1)^n-7)/4 \\ Charles R Greathouse IV, Sep 28 2015

G.f.: -x*(1+16*x+x^2) / ( (1+x)*(x-1)^3 ). - R. J. Mathar, Sep 18 2011
From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = (18*n^2 + 7*(-1)^n - 7)/4;
a(n) = -a(n-1) + 9*n^2 - 9*n + 1. (End)
Sum_{n>=1} 1/a(n) = Pi^2/108 + tan(sqrt(7)*Pi/6)*Pi/(6*sqrt(7)). - Amiram Eldar, Jan 17 2023

cp's OEIS Frontend

A153641 Nonzero coefficients of the Swiss-Knife polynomials for the computation of Euler, tangent, and Bernoulli numbers (triangle read by rows).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Maple

Mathematica

Sage

Formula

A069129 Centered 16-gonal numbers.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A047522 Numbers that are congruent to {1, 7} mod 8.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

Formula

A195040 Square array read by antidiagonals with T(n,k) = k*n^2/4+(k-4)*((-1)^n-1)/8, n>=0, k>=0.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

GAP

Maple

Mathematica

A195143 a(n) = n-th concentric 12-gonal number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Formula

A195145 Concentric 14-gonal numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

Formula

A195149 Concentric 22-gonal numbers.

Views

Author

A195040 Square array read by antidiagonals with T(n,k) = kn^2/4+(k-4)((-1)^n-1)/8, n>=0, k>=0.