A058331 -id:A058331 - cp's OEIS frontend

A161702 a(n) = (-n^3 + 9n^2 - 5n + 3)/3.

1, 2, 7, 14, 21, 26, 27, 22, 9, -14, -49, -98, -163, -246, -349, -474, -623, -798, -1001, -1234, -1499, -1798, -2133, -2506, -2919, -3374, -3873, -4418, -5011, -5654, -6349, -7098, -7903, -8766, -9689, -10674, -11723, -12838, -14021, -15274

Offset: 0

Reinhard Zumkeller, Jun 17 2009

{a(k): 0 <= k < 4} = divisors of 14:

a(n) = A027750(A006218(13) + k + 1), 0 <= k < A000005(14).

			Differences of divisors of 14 to compute the coefficients of their interpolating polynomial, see formula:
  1     2     7    14
     1     5     7
        4     2
          -2

G. C. Greubel, Table of n, a(n) for n = 0..1000
R. Zumkeller, Enumerations of Divisors
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A000124, A000125, A000127, A002522, A005408, A006261, A016813, A058331, A080856, A086514, A161701, A161703, A161704, A161706-A161708, A161710, A161711-A161713, A161715.

[(-n^3 + 9*n^2 - 5*n + 3)/3: n in [0..50]]; // Vincenzo Librandi, Dec 27 2010

A161702:=n->(-n^3 + 9*n^2 - 5*n + 3)/3: seq(A161702(n), n=0..60); # Wesley Ivan Hurt, Jul 16 2017

Table[(-n^3+9n^2-5n+3)/3,{n,0,40}] (* or *) LinearRecurrence[{4,-6,4,-1},{1,2,7,14},40] (* Harvey P. Dale, Jun 15 2013 *)

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

a(n) = C(n,0) + C(n,1) + 4*C(n,2) - 2*C(n,3).
G.f.: (1-2*x+5*x^2-6*x^3)/(1-x)^4. - Colin Barker, Jan 08 2012
a(0)=1, a(1)=2, a(2)=7, a(3)=14, a(n)=4*a(n-1)-6*a(n-2)+4*a(n-3)-a(n-4). - Harvey P. Dale, Jun 15 2013

A161703 a(n) = (4n^3 - 12n^2 + 14*n + 3)/3.

Original entry on oeis.org

1, 3, 5, 15, 41, 91, 173, 295, 465, 691, 981, 1343, 1785, 2315, 2941, 3671, 4513, 5475, 6565, 7791, 9161, 10683, 12365, 14215, 16241, 18451, 20853, 23455, 26265, 29291, 32541, 36023, 39745, 43715, 47941, 52431, 57193, 62235, 67565, 73191, 79121

Offset: 0

Reinhard Zumkeller, Jun 17 2009

{a(k): 0 <= k < 4} = divisors of 15:

a(n) = A027750(A006218(14) + k + 1), 0 <= k < A000005(15).

			Differences of divisors of 15 to compute the coefficients of their interpolating polynomial, see formula:
  1     3     5    15
     2     2    10
        0     8
           8

G. C. Greubel, Table of n, a(n) for n = 0..1000
R. Zumkeller, Enumerations of Divisors
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A000124, A000125, A000127, A002522, A005408, A006261, A016813, A058331, A080856, A086514, A161701, A161702, A161704, A161706-A161708, A161710, A161711-A161713, A161715.

[(4*n^3 - 12*n^2 + 14*n + 3)/3: n in [0..50]]; // Vincenzo Librandi, Dec 27 2010

A161703:=n->(4*n^3 - 12*n^2 + 14*n + 3)/3: seq(A161703(n), n=0..100); # Wesley Ivan Hurt, Jul 16 2017

CoefficientList[Series[(1 - x - x^2 + 9*x^3)/(1 - x)^4, {x, 0, 50}], x] (* G. C. Greubel, Jul 16 2017 *)
LinearRecurrence[{4,-6,4,-1},{1,3,5,15},50] (* Harvey P. Dale, Oct 04 2024 *)

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

a(n) = C(n,0) + 2*C(n,1) + 8*C(n,3).

G.f.: (1-x-x^2+9*x^3)/(1-x)^4. - Colin Barker, Jan 08 2012

A161711 a(n) = (-4n^3 + 27n^2 - 20*n + 3)/3.

Original entry on oeis.org

1, 2, 13, 26, 33, 26, -3, -62, -159, -302, -499, -758, -1087, -1494, -1987, -2574, -3263, -4062, -4979, -6022, -7199, -8518, -9987, -11614, -13407, -15374, -17523, -19862, -22399, -25142, -28099, -31278, -34687, -38334, -42227, -46374, -50783

Offset: 0

Reinhard Zumkeller, Jun 17 2009

{a(k): 0 <= k < 4} = divisors of 26:

a(n) = A027750(A006218(25) + k + 1), 0 <= k < A000005(26).

			Differences of divisors of 26 to compute the coefficients of their interpolating polynomial, see formula:
  1     2    13    26
     1    11    13
       10     2
          -8

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
R. Zumkeller, Enumerations of Divisors
Index entries for linear recurrences with constant coefficients, signature (4,-6,4,-1).

Cf. A005408, A000124, A016813, A086514, A000125, A058331, A002522, A161701, A161702, A161703, A000127, A161704, A161706, A161707, A161708, A161710, A080856, A161712, A161713, A161715, A006261.

[(-4*n^3 + 27*n^2 - 20*n + 3)/3: n in [0..40]]; // Vincenzo Librandi, Jul 17 2011

LinearRecurrence[{4,-6,4,-1},{1,2,13,26},40] (* Harvey P. Dale, Jul 02 2017 *)

x='x+O('x^50); Vec((1-2*x+11*x^2-18*x^3)/(1-x)^4) \\ G. C. Greubel, Jul 16 2017

a(n) = C(n,0) + C(n,1) + 10*C(n,2) - 8*C(n,3).

G.f.: (1-2*x+11*x^2-18*x^3)/(1-x)^4. - Bruno Berselli, Jul 17 2011

A093328 a(n) = 2*n^2 + 3.

Original entry on oeis.org

3, 5, 11, 21, 35, 53, 75, 101, 131, 165, 203, 245, 291, 341, 395, 453, 515, 581, 651, 725, 803, 885, 971, 1061, 1155, 1253, 1355, 1461, 1571, 1685, 1803, 1925, 2051, 2181, 2315, 2453, 2595, 2741, 2891, 3045, 3203, 3365, 3531, 3701, 3875, 4053, 4235, 4421, 4611

Offset: 0

Ralf Stephan, Apr 25 2004

Number of 132-avoiding two-stack sortable permutations which also avoid 4321.
Conjecture: no perfect powers. - Zak Seidov, Sep 27 2015
Numbers k such that 2*k - 6 is a square. - Bruno Berselli, Nov 08 2017

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Steven Edwards and William Griffiths, Generalizations of Delannoy and cross polytope numbers, Fib. Q., Vol. 55, No. 4 (2017), pp. 356-366.
Steven Edwards and William Griffiths, On Generalized Delannoy Numbers, J. Int. Seq., Vol. 23 (2020), Article 20.3.6.
Eric S. Egge and Toufik Mansour, 132-avoiding two-stack sortable permutations, Fibonacci numbers, and Pell numbers, Discrete Applied Mathematics, Vol. 143, No. 1-3 (2004), pp. 72-83; arXiv preprint, arXiv:math/0205206 [math.CO], 2002.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001105, A005893, A058331, A154685.

[2*n^2+3: n in [0..50]]; // Vincenzo Librandi, Jul 08 2012

Table[2 n^2 + 3, {n, 0, 100}] (* Vladimir Joseph Stephan Orlovsky, Feb 15 2011*)
CoefficientList[Series[(3 - 4 x + 5 x^2)/(1 - x)^3, {x, 0, 50}], x] (* Vincenzo Librandi, Jul 08 2012 *)
LinearRecurrence[{3, -3, 1}, {3, 5, 11}, 50] (* Harvey P. Dale, Apr 03 2016 *)

a(n)=2*n^2+3; \\ Zak Seidov, Sep 27 2015

a(n) = A005893(n)+1 = A058331(n)+2 = A001105(n)+3.
a(n+2) = A154685(n+1,n+2).
From Vincenzo Librandi, Jul 08 2012: (Start)
G.f.: (3 - 4*x + 5*x^2)/(1 - x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). (End)
Sum_{n>=0} 1/a(n) = (1 + sqrt(3/2)*Pi*coth(sqrt(3/2)*Pi))/6. - Amiram Eldar, Nov 25 2020
E.g.f.: exp(x)*(3 + 2*x + 2*x^2). - Elmo R. Oliveira, Jan 17 2025

Simpler definition and new offset from Paul F. Brewbaker, Jun 23 2009

Edited by N. J. A. Sloane, Jun 27 2009

A099392 a(n) = floor((n^2 - 2*n + 3)/2).

Original entry on oeis.org

1, 1, 3, 5, 9, 13, 19, 25, 33, 41, 51, 61, 73, 85, 99, 113, 129, 145, 163, 181, 201, 221, 243, 265, 289, 313, 339, 365, 393, 421, 451, 481, 513, 545, 579, 613, 649, 685, 723, 761, 801, 841, 883, 925, 969, 1013, 1059, 1105, 1153, 1201, 1251, 1301, 1353, 1405

Offset: 1

Ralf Stephan following a suggestion from Luke Pebody, Oct 20 2004

Guenther Schrack, Table of n, a(n) for n = 1..10010
Index entries for linear recurrences with constant coefficients, signature (2,0,-2,1).

Differs from A085913 at n = 61. Apart from leading term, identical to A080827.
Cf. A000217, A001844, A002522, A007494, A007590, A058331 (bisections).
From Guenther Schrack, Apr 17 2018: (Start)
First differences: A052928.
Partial sums: A212964(n) + n for n > 0.
Also A058331 and A001844 interleaved. (End)
Cf. A014601, A033683, A047838, A074148, A109613, A183575, A290743.

Array[Floor[(#^2 - 2 # + 3)/2] &, 54] (* or *)
Rest@ CoefficientList[Series[x (-1 + x - x^2 - x^3)/((1 + x) (x - 1)^3), {x, 0, 54}], x] (* Michael De Vlieger, Apr 21 2018 *)

a(n)=(n^2+3)\2-n \\ Charles R Greathouse IV, Aug 01 2013

a(n) = ceiling(n^2/2)-n+1. - Paul Barry, Jul 16 2006; index shifted by R. J. Mathar, Jul 29 2007
a(n) = ceiling(A002522(n-1)/2). - Branko Curgus, Sep 02 2007
From R. J. Mathar, Feb 20 2011: (Start)
G.f.: x *( -1+x-x^2-x^3 ) / ( (1+x)*(x-1)^3 ).
a(n) = 2*a(n-1) - 2*a(n-3) + a(n-4).
a(n+1) = (3 + 2*n^2 + (-1)^n)/4. (End)
a(n) = A007590(n-1) + 1 for n >= 2. - Richard R. Forberg, Aug 01 2013
a(n) = A000217(n) - A007494(n-1). - Bui Quang Tuan, Mar 27 2015
From Guenther Schrack, Apr 17 2018: (Start)
a(n) = (2*n^2 - 4*n + 5 -(-1)^n)/4.
a(n+2) = a(n) + 2*n for n > 0.
a(n) = 2*A033683(n-1) - 1 for n > 0.
a(n) = A047838(n-1) + 2 for n > 2.
a(n) = A074148(n-1) - n + 2 for n > 1.
a(n) = A183575(n-3) + 3 for n > 3.
a(n) = 2*A290743(n-1) - 3 for n > 0.
a(n) = 2*A290743(n-2) + A109613(n-5) for n > 4.
a(n) = A074148(n) - A014601(n-1) for n > 0. (End)
Sum_{n>=1} 1/a(n) = tanh(Pi/2)*Pi/2 + coth(Pi/sqrt(2))*Pi/(2*sqrt(2)) + 1/2. - Amiram Eldar, Sep 16 2022
E.g.f.: ((2 - x + x^2)*cosh(x) + (3 - x + x^2)*sinh(x) - 2)/2. - Stefano Spezia, Jan 28 2024

A173129 a(n) = cosh(2 * n * arccosh(n)).

Original entry on oeis.org

1, 1, 97, 19601, 7380481, 4517251249, 4097989415521, 5170128475599457, 8661355881006882817, 18605234632923999244961, 49862414878754347585980001, 163104845048002042971670685041, 639582975902942936737758325440001

Offset: 0

Artur Jasinski, Feb 10 2010

nonn

Seiichi Manyama, Table of n, a(n) for n = 0..193
Wikipedia, Chebyshev polynomials.
Index entries for sequences related to Chebyshev polynomials.

Cf. A001079, A037270, A053120 (Chebyshev polynomial), A058331, A115066, A132592, A146311, A146312, A146313, A173115, A173116, A173121, A173127, A173128, A173148.

Cf. A349070, A349071, A349073.

seq(orthopoly[T](2*n,n), n=0..50); # Robert Israel, Dec 27 2018

Table[Round[Cosh[2 n ArcCosh[n]]], {n, 0, 20}] (* Artur Jasinski, Feb 10 2010 *)
Round[Table[1/2 (x - Sqrt[ -1 + x^2])^(2 x) + 1/2 (x + Sqrt[ -1 + x^2])^(2 x), {x, 0, 10}]] (* Artur Jasinski, Feb 14 2010 *)
Table[ChebyshevT[2*n, n], {n, 0, 15}] (* Vaclav Kotesovec, Nov 07 2021 *)

{a(n) = sum(k=0, n, binomial(2*n, 2*k)*(n^2-1)^(n-k)*n^(2*k))} \\ Seiichi Manyama, Dec 27 2018

{a(n) = polchebyshev(2*n, 1, n)} \\ Seiichi Manyama, Dec 28 2018

{a(n) = polchebyshev(n, 1, 2*n^2-1)} \\ Seiichi Manyama, Dec 29 2018

a(n) = (1/2)*((n+sqrt(n^2-1))^(2*n) + (n-sqrt(n^2-1))^(2*n)). - Artur Jasinski, Feb 14 2010, corrected by Vaclav Kotesovec, Apr 05 2016
a(n) = Sum_{k=0..n} binomial(2*n,2*k)*(n^2-1)^(n-k)*n^(2*k). - Seiichi Manyama, Dec 27 2018
a(n) = T_{2n}(n) where T_{2n} is a Chebyshev polynomial of the first kind. - Robert Israel, Dec 27 2018
a(n) = T_{n}(2*n^2-1) where T_{n}(x) is a Chebyshev polynomial of the first kind. - Seiichi Manyama, Dec 29 2018

A173127 a(n) = sinh((2n-1)*arcsinh(3)).

Original entry on oeis.org

-3, 3, 117, 4443, 168717, 6406803, 243289797, 9238605483, 350823718557, 13322062699683, 505887558869397, 19210405174337403, 729489509065951917, 27701390939331835443, 1051923366185543794917, 39945386524111332371403

Offset: 0

Artur Jasinski, Feb 10 2010

Numbers n such that ((n^2 + 1)/10) is a square. - Vincenzo Librandi, Jan 02 2012

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

Cf. A058331 A001079, A037270, A071253, A108741, A132592, A146311-A146313, A173115, A173116, A173121.

[-3] cat [n: n in [0..10^7]|IsSquare((n^2+1)/10)]; // Vincenzo Librandi, Jan 02 2012

LinearRecurrence[{38,-1},{-3,3},30] (* Harvey P. Dale, Jan 14 2015 *)

from itertools import islice
def A173127_gen(): # generator of terms
    x, y = -30, 10
    while True:
        yield x//10
        x, y = x*19+y*60, x*6+y*19
A173127_list = list(islice(A173127_gen(),20)) # Chai Wah Wu, Apr 24 2025

a(n) = (1/2)*((-3+sqrt(10))*(19+6*sqrt(10))^n + (-3-sqrt(10))*(19-6*sqrt(10))^n).
a(n) = -a(-n+1).
G.f.: -3*(1-39*x)/(1-38*x+x^2). - Bruno Berselli, Jan 03 2011
E.g.f.: exp(19*x)*(-3*cosh(6*sqrt(10)*x) + sqrt(10)*sinh(6*sqrt(10)*x)). - Stefano Spezia, Apr 24 2025

A090698 Primes of the form 2*n^2+1.

Original entry on oeis.org

3, 19, 73, 163, 883, 1153, 1459, 1801, 2179, 2593, 3529, 4051, 8713, 10369, 11251, 15139, 17299, 18433, 19603, 20809, 22051, 30259, 34849, 36451, 46819, 48673, 52489, 62659, 69193, 71443, 80803, 83233, 95923, 103969, 112339, 115201, 130051

Offset: 1

Kurmang. Aziz. Rashid, Dec 20 2003

A prime p can be expressed as either the sum of two squares or the sum of two squares - 1, p = X^2 + Y^2 or p = X^2 + Y^2 - 1, if and only if p is of the form 2*(m^2)+1 where m is either 1 or a multiple of 3.
Conjecture: 2^(a(n)-1) - 3 is not prime. - Vincenzo Librandi, Feb 04 2013.
Primes in A058331. - Vincenzo Librandi, Apr 10 2015

			19 = 2^2 + 4^2 - 1 = 2*(3^2)+1
73 = 5^2 + 7^2 - 1 = 2*(6^2)+1
163= 8^2 + 10^2 -1 = 2*(9^2)+1
883= 10^2+ 28^2 -1 = 2*(21^2)+1

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

Cf. A058331, A089001, A089008, A090612.

[a: n in [0..400] | IsPrime(a) where a is 2*n^2+1];// Vincenzo Librandi, Dec 02 2011

Select[Table[2n^2+1,{n,0,900}],PrimeQ] (* Vincenzo Librandi, Dec 02 2011 *)

is(n)=isprime(2*n^2+1) \\ Charles R Greathouse IV, Jan 05 2013

a(n)=2*A089001(n)^2+1 = A000040(A090612(n)).

Extended by Ray Chandler, Dec 21 2003

A173128 a(n) = cosh(2narcsinh(n)).

Original entry on oeis.org

1, 3, 161, 27379, 9478657, 5517751251, 4841332221601, 5964153172084899, 9814664424981012481, 20791777842234580902499, 55106605639755476546020001, 178627672869645203363556318483, 695165908550906808156689590141441

Offset: 0

Artur Jasinski, Feb 10 2010

nonn

Robert Israel, Table of n, a(n) for n = 0..192
Wikipedia, Chebyshev polynomials.
Index entries for sequences related to Chebyshev polynomials.

Cf. A058331, A001079, A037270, A071253, A108741, A132592, A146311, A146312, A146313, A173115, A173116, A173121, A173127, A173129, A173174.

seq(expand( (1/2)*((n + sqrt(n^2 + 1))^(2*n) + (n - sqrt(n^2 + 1))^(2*n))), n=0..30); # Robert Israel, Apr 05 2016

Round[Table[Cosh[2 n ArcSinh[n]], {n, 0, 20}]] (* Artur Jasinski *)
Round[Table[1/2 (x - Sqrt[1 + x^2])^(2 x) + 1/2 (x + Sqrt[1 + x^2])^(2 x), {x, 0, 20}]] (* Artur Jasinski, Feb 14 2010 *)

{a(n) = sum(k=0, n, binomial(2*n, 2*k)*(n^2+1)^(n-k)*n^(2*k))} \\ Seiichi Manyama, Dec 27 2018

{a(n) = polchebyshev(n, 1, 2*n^2+1)} \\ Seiichi Manyama, Dec 29 2018

a(n) = (1/2)*((n + sqrt(n^2 + 1))^(2*n) + (n - sqrt(n^2 + 1))^(2*n)). - Artur Jasinski, Feb 14 2010, corrected by Vaclav Kotesovec, Apr 05 2016
a(n) = Sum_{k=0..n} binomial(2*n,2*k)*(n^2+1)^(n-k)*n^(2*k). - Seiichi Manyama, Dec 27 2018
a(n) = T_{n}(2*n^2+1) where T_{n}(x) is a Chebyshev polynomial of the first kind. - Seiichi Manyama, Dec 29 2018

A188645 Array of ((k^n)+(k^(-n)))/2 where k=(sqrt(x^2+1)+x)^2 for integers x>=1.

Original entry on oeis.org

1, 3, 1, 17, 9, 1, 99, 161, 19, 1, 577, 2889, 721, 33, 1, 3363, 51841, 27379, 2177, 51, 1, 19601, 930249, 1039681, 143649, 5201, 73, 1, 114243, 16692641, 39480499, 9478657, 530451, 10657, 99, 1, 665857, 299537289, 1499219281, 625447713, 54100801, 1555849, 19601, 129, 1

Offset: 0

Charles L. Hohn, Apr 06 2011

Conjecture: Given function f(x, y)=(sqrt(x^2+y)+x)^2; and constant k=f(x, y); then for all integers x>=1 and y=[+-]1, k may be irrational, but ((k^n)+(k^(-n)))/2 always produces integer sequences; y=1 results shown here; y=-1 results are A188644.

Also square array A(n,k), n >= 1, k >= 0, read by antidiagonals, where A(n,k) is Chebyshev polynomial of the first kind T_{k}(x), evaluated at x=2*n^2+1. - Seiichi Manyama, Jan 01 2019

			Square array begins:
     | 0    1       2          3             4
-----+---------------------------------------------
   1 | 1,   3,     17,        99,          577, ...
   2 | 1,   9,    161,      2889,        51841, ...
   3 | 1,  19,    721,     27379,      1039681, ...
   4 | 1,  33,   2177,    143649,      9478657, ...
   5 | 1,  51,   5201,    530451,     54100801, ...
   6 | 1,  73,  10657,   1555849,    227143297, ...
   7 | 1,  99,  19601,   3880899,    768398401, ...
   8 | 1, 129,  33281,   8586369,   2215249921, ...
   9 | 1, 163,  53137,  17322499,   5647081537, ...
  10 | 1, 201,  80801,  32481801,  13057603201, ...
  11 | 1, 243, 118097,  57394899,  27893802817, ...
  12 | 1, 289, 167041,  96549409,  55805391361, ...
  13 | 1, 339, 229841, 155831859, 105653770561, ...
  14 | 1, 393, 308897, 242792649, 190834713217, ...
  15 | 1, 451, 406801, 366934051, 330974107201, ...
  ...

Row 1 is A001541, row 2 is A023039, row 3 is A078986, row 4 is A099370, row 5 is A099397, row 6 is A174747, row 8 is A176368, (row 1)*2 is A003499, (row 2)*2 is A087215.
Column 1 is A058331, (column 1)*2 is A005899.
A188644 (f(x, y) as above with y=-1).
Diagonal gives A173128.
Cf. A188647.

max = 9; y = 1; t = Table[k = ((x^2 + y)^(1/2) + x)^2; ((k^n) + (k^(-n)))/2 // FullSimplify, {n, 0, max - 1}, {x, 1, max}]; Table[ t[[n - k + 1, k]], {n, 1, max}, {k, 1, n}] // Flatten (* Jean-François Alcover, Jul 17 2013 *)

A(n,k) = (A188647(n,k-1) + A188647(n,k))/2.

A(n,k) = Sum_{j=0..k} binomial(2*k,2*j)*(n^2+1)^(k-j)*n^(2*j). - Seiichi Manyama, Jan 01 2019

Edited and extended by Seiichi Manyama, Jan 01 2019

cp's OEIS Frontend

A161702 a(n) = (-n^3 + 9n^2 - 5n + 3)/3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A161703 a(n) = (4*n^3 - 12*n^2 + 14*n + 3)/3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Formula

A161711 a(n) = (-4*n^3 + 27*n^2 - 20*n + 3)/3.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A093328 a(n) = 2*n^2 + 3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A099392 a(n) = floor((n^2 - 2*n + 3)/2).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A173129 a(n) = cosh(2 * n * arccosh(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

Maple

Mathematica

PARI

PARI

PARI

Formula

A173127 a(n) = sinh((2n-1)*arcsinh(3)).

Views

A161703 a(n) = (4n^3 - 12n^2 + 14*n + 3)/3.

A161711 a(n) = (-4n^3 + 27n^2 - 20*n + 3)/3.

A173128 a(n) = cosh(2narcsinh(n)).