A024002 -id:A024002 - cp's OEIS frontend

A053698 a(n) = n^3 + n^2 + n + 1.

1, 4, 15, 40, 85, 156, 259, 400, 585, 820, 1111, 1464, 1885, 2380, 2955, 3616, 4369, 5220, 6175, 7240, 8421, 9724, 11155, 12720, 14425, 16276, 18279, 20440, 22765, 25260, 27931, 30784, 33825, 37060, 40495, 44136, 47989, 52060, 56355, 60880

Offset: 0

Henry Bottomley, Mar 23 2000

a(n) = 1111 in base n.

n^3 + n^2 + n + 1 = (n^2 + 1)*(n + 1), therefore a(n) is never prime. - Alonso del Arte, Apr 22 2014

			a(2) = 15 because 2^3 + 2^2 + 2 + 1 = 8 + 4 + 2 + 1 = 15.
a(3) = 40 because 3^3 + 3^2 + 3 + 1 = 27 + 9 + 3 + 1 = 40.
a(4) = 85 because 4^3 + 4^2 + 4 + 1 = 64 + 16 + 4 + 1 = 85.
From _Bruno Berselli_, Jan 02 2017: (Start)
The terms of the sequence are provided by the row sums of the following triangle (see the seventh formula in the previous section):
.   1;
.   3,   1;
.   9,   5,   1;
.  19,  13,   7,   1;
.  33,  25,  17,   9,   1;
.  51,  41,  31,  21,  11,   1;
.  73,  61,  49,  37,  25,  13,  1;
.  99,  85,  71,  57,  43,  29, 15,  1;
. 129, 113,  97,  81,  65,  49, 33, 17,  1;
. 163, 145, 127, 109,  91,  73, 55, 37, 19,  1;
. 201, 181, 161, 141, 121, 101, 81, 61, 41, 21, 1;
...
Columns from the first to the fifth, respectively: A058331, A001844, A056220 (after -1), A059993, A161532. Also, eighth column is A161549.
(End)

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

Cf. A237627 (subset of semiprimes).
Cf. A056106 (first differences).
Cf. A062158, A027444, A104878, A055129.

[n^3+n^2+n+1: n in [0..50]]; // Vincenzo Librandi, May 01 2011

A053698:=n->n^3 + n^2 + n + 1; seq(A053698(n), n=0..50); # Wesley Ivan Hurt, Apr 22 2014

Table[n^3 + n^2 + n + 1, {n, 0, 39}] (* Alonso del Arte, Apr 22 2014 *)
FromDigits["1111", Range[0, 50]] (* Paolo Xausa, May 11 2024 *)

Vec((1 + 5*x^2) / (1 - x)^4 + O(x^50)) \\ Colin Barker, Jan 02 2017

def a(n): return (n**3+n**2+n+1) # Torlach Rush, May 08 2024

For n >= 2, a(n) = (n^4-1)/(n-1) = A024002(n)/A024000(n) = A002522(n)*(n+1) = A002061(n+1) + A000578(n).
G.f.: (1+5*x^2) / (1-x)^4. - Colin Barker, Jan 06 2012
a(n) = -A062158(-n). - Bruno Berselli, Jan 26 2016
a(n) = Sum_{i=0..n} 2*n*(n-i)+1. - Bruno Berselli, Jan 02 2017
a(n) = 4*a(n-1) - 6*a(n-2) + 4*a(n-3) - a(n-4) for n > 3. - Colin Barker, Jan 02 2017
a(n) = A104878(n+3,n) = A055129(4,n) for n > 0. - Mathew Englander, Jan 06 2021
E.g.f.: exp(x)*(x^3+4*x^2+3*x+1). - Nikolaos Pantelidis, Feb 06 2023

A123865 a(n) = n^4 - 1.

Original entry on oeis.org

0, 15, 80, 255, 624, 1295, 2400, 4095, 6560, 9999, 14640, 20735, 28560, 38415, 50624, 65535, 83520, 104975, 130320, 159999, 194480, 234255, 279840, 331775, 390624, 456975, 531440, 614655, 707280, 809999, 923520, 1048575, 1185920, 1336335

Offset: 1

Reinhard Zumkeller, Oct 16 2006

a(n) mod 5 = 0 iff n mod 5 > 0: a(A008587(n)) = 4; a(A047201(n)) = 0; a(n) mod 5 = 4*(1-A079998(n)).

A129292(n) = number of divisors of a(n) that are not greater than n. - Reinhard Zumkeller, Apr 09 2007

Vincenzo Librandi, Table of n, a(n) for n = 1..1000
Milan Janjic and Boris Petkovic, A Counting Function, arXiv 1301.4550 [math.CO], 2013.
Index entries for linear recurrences with constant coefficients, signature (5,-10,10,-5,1).

Cf. A000583, A005563, A024002, A123866, A123867, A123868, A219086.

List([1..40], n-> n^4 -1); # G. C. Greubel, Aug 08 2019

[n^4 - 1: n in [1..40]]; // Vincenzo Librandi, May 01 2011

seq(n^4 -1, n=1..40); # G. C. Greubel, Aug 08 2019

Table[n^4-1,{n,40}] (* Vladimir Joseph Stephan Orlovsky, Apr 15 2011 *)

vector(40, n, n^4 -1) \\ G. C. Greubel, Aug 08 2019

[n^4 -1 for n in (1..40)] # G. C. Greubel, Aug 08 2019

G.f.: x^2*(15 + 5*x + 5*x^2 - x^3)/(1-x)^5. - Colin Barker, Jan 10 2012
-4*a(n+1) = -4*n*(n+2)*(n^2+2*n+2) = (n+n*i)*(n+2+n*i)*(n+(n+2)*i)*(n+2+(n+2)*i), where i is the imaginary unit. - Jon Perry, Feb 05 2014
From Vaclav Kotesovec, Feb 14 2015: (Start)
Sum_{n>=2} 1/a(n) = 7/8 - Pi*coth(Pi)/4 = A256919.
Sum_{n>=2} (-1)^n / a(n) = 1/8 - Pi/(4*sinh(Pi)). (End)
a(n) = A005563(A005563(n)). - Bruno Berselli, May 28 2015
E.g.f.: 1 + (-1 + x + 7*x^2 + 6*x^3 + x^4)*exp(x). - G. C. Greubel, Aug 08 2019
Product_{n>=2} (1 + 1/a(n)) = 4*Pi*csch(Pi). - Amiram Eldar, Jan 20 2021

A061167 a(n) = n^5 - n.

Original entry on oeis.org

0, 0, 30, 240, 1020, 3120, 7770, 16800, 32760, 59040, 99990, 161040, 248820, 371280, 537810, 759360, 1048560, 1419840, 1889550, 2476080, 3199980, 4084080, 5153610, 6436320, 7962600, 9765600, 11881350, 14348880, 17210340, 20511120, 24299970, 28629120

Offset: 0

Henry Bottomley, Apr 18 2001

(b^2+c^2)/(bc+1) is an integer if {b,c} are of the form {0,n}, {n,n^3}, {n^3,n^5-n}, {n^5-n,n^7-2n^3}, {n^7-2n^3,n^9-3n^5+n}, etc. for some n, in which case the division results in n^2. Cf. A052530.

Convolution of A033429 by A033581. - R. J. Mathar, Aug 19 2008

			a(2) = 32 - 2 = 30.

Vincenzo Librandi, Table of n, a(n) for n = 0..1000
D. Zagier, Problems posed at the St Andrews Colloquium, 1996
Index entries for linear recurrences with constant coefficients, signature (6,-15,20,-15,6,-1).

Subsequence of A249674.

Cf. A000584, A024002, A033429, A033455, A033581, A052530.

[n^5-n: n in [0..40]]; // Vincenzo Librandi, May 02 2011

Table[n^5 - n, {n, 0, 40}] (* Vladimir Joseph Stephan Orlovsky, Feb 20 2012 *)

a(n) = 30*A033455(n-1). [Corrected by Bernard Schott, Mar 16 2021]
a(n) = -n*A024002(n).
a(n) = A000584(n) - n.
O.g.f.: 30x^2(1+x)^2/(1-x)^6. - R. J. Mathar, Aug 19 2008
a(n) = n * (n-1) * (n+1) * (n^2+1). - Bernard Schott, Mar 16 2021
E.g.f.: exp(x)*x^2*(15 + 25*x + 10*x^2 + x^3). - Stefano Spezia, Dec 27 2021

A258837 a(n) = 1 - n^2.

Original entry on oeis.org

1, 0, -3, -8, -15, -24, -35, -48, -63, -80, -99, -120, -143, -168, -195, -224, -255, -288, -323, -360, -399, -440, -483, -528, -575, -624, -675, -728, -783, -840, -899, -960, -1023, -1088, -1155, -1224, -1295, -1368, -1443, -1520, -1599, -1680, -1763, -1848

Offset: 0

Vincenzo Librandi, Jun 12 2015

G. C. Greubel, Table of n, a(n) for n = 0..5000
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A067998, A131386, A007531.

Sequences of the type 1-n^k: A024000 (k=1), this sequence (k=2), A024001 (k=3), A024002 (k=4), A024003 (k=5), A024004 (k=6), A024005 (k=7), A024006 (k=8), A024007 (k=9), A024008 (k=10), A024009 (k=11), A024010 (k=12).

Magma
```
[1-n^2: n in [0..50]];
```

I:=[1,0,-3]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+Self(n-3): n in [1..50]];

Table[1 - n^2, {n, 0, 50}] (* or *) LinearRecurrence[{3, -3, 1}, {1, 0, -3}, 50]

my(x='x+O('x^50)); Vec((1-3*x)/(1-x)^3) \\ G. C. Greubel, May 11 2017

G.f.: (1-3*x)/(1-x)^3.
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3).
a(n) = -A067998(n+1). - Joerg Arndt, Jun 13 2015
a(n) = (-1)^n*A131386(n+1). - Bruno Berselli, Jun 15 2015
E.g.f.: (1 - x - x^2)*exp(x). - G. C. Greubel, May 11 2017
Sum_{n>=2} 1/a(n) = -3/4. - Amiram Eldar, Feb 17 2023

cp's OEIS Frontend

A053698 a(n) = n^3 + n^2 + n + 1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Python

Formula

A123865 a(n) = n^4 - 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A061167 a(n) = n^5 - n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A258837 a(n) = 1 - n^2.

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Magma

Mathematica

PARI

Formula