A173511 -id:A173511 - cp's OEIS frontend

A007494 Numbers that are congruent to 0 or 2 mod 3.

0, 2, 3, 5, 6, 8, 9, 11, 12, 14, 15, 17, 18, 20, 21, 23, 24, 26, 27, 29, 30, 32, 33, 35, 36, 38, 39, 41, 42, 44, 45, 47, 48, 50, 51, 53, 54, 56, 57, 59, 60, 62, 63, 65, 66, 68, 69, 71, 72, 74, 75, 77, 78, 80, 81, 83, 84, 86, 87, 89, 90, 92, 93, 95, 96, 98, 99, 101, 102, 104, 105, 107

Offset: 0

Christopher Lam Cham Kee (Topher(AT)CyberDude.Com)

The map n -> a(n) (where a(n) = 3n/2 if n even or (3n+1)/2 if n odd) was studied by Mahler, in connection with "Z-numbers" and later by Flatto. One question was whether, iterating from an initial integer, one eventually encountered an iterate = 1 (mod 4). - Jeff Lagarias, Sep 23 2002
Partial sums of 0,2,1,2,1,2,1,2,1,... . - Paul Barry, Aug 18 2007
a(n) = numbers k such that antiharmonic mean of the first k positive integers is not integer. A169609(a(n-1)) = 3. See A146535 and A169609. Complement of A016777. - Jaroslav Krizek, May 28 2010
Range of A173732. - Reinhard Zumkeller, Apr 29 2012
Number of partitions of 6n into two odd parts. - Wesley Ivan Hurt, Nov 15 2014
Numbers m such that 3 divides A000217(m). - Bruno Berselli, Aug 04 2017
Maximal length of a snake like polyomino that fits in a 2 X n rectangle. - Alain Goupil, Feb 12 2020

L. Flatto, Z-numbers and beta-transformations, in Symbolic dynamics and its applications (New Haven, CT, 1991), 181-201, Contemp. Math., 135, Amer. Math. Soc., Providence, RI, 1992.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1002.
Attila Máder, The Use of Experimental Mathematics in the Classroom, in Interesting Mathematical Problems in Sciences and Everyday Life - 2011.
Kurt Mahler, An unsolved problem on the powers of 3/2, J. Austral. Math. Soc., Vol. 8 (1968), pp. 313-321.
P. Sabinin and M. G. Stone, Transforming n-gons by Folding the Plane, Amer. Math. Monthly, Vol. 102, No. 7 (1995), pp. 620-627.
Eric Weisstein's World of Mathematics, Folding.
Robert G. Wilson v, Notes with attachment.
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Cf. A000217, A001651, A032766, A035361, A063574, A132462.
Complement of A016777.
Range of A002517.
Cf. A274406. [Bruno Berselli, Jun 26 2016]

a007494 =  flip div 2 . (+ 1) . (* 3) -- Reinhard Zumkeller, Dec 12 2014

[(6*n+1)/4-(-1)^n/4: n in [0..80]]; // Vincenzo Librandi, Aug 20 2011

a[0]:=0:a[1]:=2:for n from 2 to 100 do a[n]:=a[n-2]+3 od: seq(a[n], n=0..71); # Zerinvary Lajos, Mar 16 2008
A007494:=n->floor((3*n+1)/2); seq(A007494(k), k=0..100); # Wesley Ivan Hurt, Sep 27 2013

Flatten[{#,#+2}&/@(3Range[0,40])] (* Harvey P. Dale, May 15 2011 *)
Table[2n - Floor[n/2], {n,0,100}] (* Wesley Ivan Hurt, Sep 27 2013 *)

a(n)=n+(n+1)>>1 \\ Charles R Greathouse IV, Jul 25 2011

a(n) = 3*n/2 if n even, otherwise (3*n+1)/2.
If u(1)=0, u(n) = n + floor(u(n-1)/3), then a(n-1) = u(n). - Benoit Cloitre, Nov 26 2002
G.f.: x*(x+2)/((1-x)^2*(1+x)). - Ralf Stephan, Apr 13 2002
a(n) = 3*floor(n/2) + 2*(n mod 2) = A032766(n) + A000035(n). - Reinhard Zumkeller, Apr 04 2005
a(n) = (6*n+1)/4 - (-1)^n/4; a(n) = Sum_{k=0..n-1} (1 + (-1)^(k/2)*cos(k*Pi/2)). - Paul Barry, Aug 18 2007
A145389(a(n)) <> 1. - Reinhard Zumkeller, Oct 10 2008
a(n) = A002943(n) - A173511(n). - Reinhard Zumkeller, Feb 20 2010
a(n) = 3*n - a(n-1) - 1 (with a(0)=0). - Vincenzo Librandi, Nov 18 2010
a(n) = Sum_{k>=0} A030308(n,k)*A042950(k). - Philippe Deléham, Oct 17 2011
a(n) = n + ceiling(n/2). - Arkadiusz Wesolowski, Sep 18 2012
a(n) = 2n - floor(n/2) = floor((3n+1)/2) = n + (n + (n mod 2))/2. - Wesley Ivan Hurt, Oct 19 2013
a(n) = A000217(n+1) - A099392(n+1). - Bui Quang Tuan, Mar 27 2015
a(n) = n + floor(n/2) + (n mod 2). - Bruno Berselli, Apr 04 2016
a(n) = Sum_{i=1..n} numerator(2/i). - Wesley Ivan Hurt, Feb 26 2017
a(n) = Sum_{k=0..n-1} Sum_{i=0..k} C(i,k)+(-1)^(k-i). - Wesley Ivan Hurt, Sep 20 2017
E.g.f.: (3*exp(x)*x + sinh(x))/2. - Stefano Spezia, Feb 11 2020
Sum_{n>=1} (-1)^(n+1)/a(n) = log(3)/2 - Pi/(6*sqrt(3)). - Amiram Eldar, Dec 04 2021

A002943 a(n) = 2n(2*n+1).

Original entry on oeis.org

0, 6, 20, 42, 72, 110, 156, 210, 272, 342, 420, 506, 600, 702, 812, 930, 1056, 1190, 1332, 1482, 1640, 1806, 1980, 2162, 2352, 2550, 2756, 2970, 3192, 3422, 3660, 3906, 4160, 4422, 4692, 4970, 5256, 5550, 5852, 6162, 6480, 6806, 7140, 7482, 7832, 8190, 8556, 8930

Offset: 0

N. J. A. Sloane

a(n) is the number of edges in (n+1) X (n+1) square grid with all horizontal, vertical and diagonal segments filled in. - Asher Auel, Jan 12 2000
In other words, the edge count of the (n+1) X (n+1) king graph. - Eric W. Weisstein, Jun 20 2017
Write 0,1,2,... in clockwise spiral; sequence gives numbers on one of 4 diagonals. (See Example section.)
The identity (4*n+1)^2 - (4*n^2+2*n)*(2)^2 = 1 can be written as A016813(n)^2 - a(n)*2^2 = 1. - Vincenzo Librandi, Jul 20 2010 - Nov 25 2012
Starting with "6" = binomial transform of [6, 14, 8, 0, 0, 0, ...]. - Gary W. Adamson, Aug 27 2010
The hyper-Wiener index of the crown graph G(n) (n>=3). The crown graph G(n) is the graph with vertex set {x(1), x(2), ..., x(n), y(1), y(2), ..., y(n)} and edge set {(x(i), y(j)): 1 <= i,j <= n, i != j} (= the complete bipartite graph K(n,n) with horizontal edges removed). The Hosoya-Wiener polynomial of G(n) is n(n-1)(t+t^2)+nt^3. - Emeric Deutsch, Aug 29 2013
Sum of the numbers from n to 3n. - Wesley Ivan Hurt, Oct 27 2014

			64--65--66--67--68--69--70--71--72
|
63  36--37--38--39--40--41--42
|   |                       |
62  35  16--17--18--19--20  43
|   |   |               |   |
61  34  15   4---5---6  21  44
|   |   |    |       |  |   |
60  33  14   3   0   7  22  45
|   |   |    |   |   |  |   |
59  32  13   2---1   8  23  46
|   |   |            |  |   |
58  31  12--11--10---9  24  47
|   |                   |   |
57  30--29--28--27--26--25  48
|                           |
56--55--54--53--52--51--50--49

R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

T. D. Noe, Table of n, a(n) for n = 0..1000
Amelia Carolina Sparavigna, The groupoids of Mersenne, Fermat, Cullen, Woodall and other Numbers and their representations by means of integer sequences, Politecnico di Torino, Italy (2019), [math.NT].
Leo Tavares, Illustration: Twin Diamond Stars.
Eric Weisstein's World of Mathematics, Crown Graph.
Eric Weisstein's World of Mathematics, Edge Count.
Eric Weisstein's World of Mathematics, King Graph.
Eric Weisstein's World of Mathematics, Queen Graph.
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A001477, A007395, A007494, A007742, A014105, A016813, A033954, A045896, A046092, A054000, A118729, A173511.
Same as A033951 except start at 0.
Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, this sequence, A033996, A033988.
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, this sequence = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
Cf. A003154, A056220, A002939.

a002943 n = 2 * n * (2 * n + 1)  -- Reinhard Zumkeller, Jan 12 2014

[ 4*n^2+2*n: n in [0..50]]; // Vincenzo Librandi, Nov 25 2012

A002943 := proc(n)
    2*n*(2*n+1) ;
end proc: # R. J. Mathar, Jun 28 2013

LinearRecurrence[{3, -3, 1}, {0, 6, 20}, 40] (* Harvey P. Dale, Aug 11 2011 *)
Table[2 n (2 n + 1), {n, 0, 40}] (* Harvey P. Dale, Aug 11 2011 *)

a(n)=2*n*(2*n+1) \\ Charles R Greathouse IV, Nov 20 2012

a(n) = 4*n^2 + 2*n.
a(n) = 2*A014105(n). - Omar E. Pol, May 21 2008
a(n) = floor((2*n + 1/2)^2). - Reinhard Zumkeller, Feb 20 2010
a(n) = A007494(n) + A173511(n) = A007742(n) + n. - Reinhard Zumkeller, Feb 20 2010
a(n) = 8*n+a(n-1) - 2 with a(0)=0. - Vincenzo Librandi, Jul 20 2010
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Aug 11 2011
a(n+1) = A045896(2*n+1). - Reinhard Zumkeller, Dec 12 2011
G.f.: 2*x*(3+x)/(1-x)^3. - Colin Barker, Jan 14 2012
From R. J. Mathar, Jan 15 2013: (Start)
Sum_{n>=1} 1/a(n) = 1 - log(2).
Sum_{n>=1} 1/a(n)^2 = 2*log(2) + Pi^2/6 - 3. (End)
a(n) = A118729(8*n+5). - Philippe Deléham, Mar 26 2013
a(n) = 1*A001477(n) + 2*A000217(n) + 3*A000290(n). - J. M. Bergot, Apr 23 2014
a(n) = 2 * A000217(2*n) = 2 * A014105(n). - Jon Perry, Oct 27 2014
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/4 + log(2)/2 - 1. - Amiram Eldar, Feb 22 2022
a(n) = A003154(n+1) - A056220(n+1). - Leo Tavares, Mar 31 2022
E.g.f.: 2*exp(x)*x*(3 + 2*x). - Stefano Spezia, Apr 24 2024
a(n) = A002939(-n) for all n in Z. - Charles Kusniec, Aug 12 2025

Formula fixed by Reinhard Zumkeller, Apr 09 2010

A110654 a(n) = ceiling(n/2), or: a(2k) = k, a(2k+1) = k+1.

Original entry on oeis.org

0, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 19, 19, 20, 20, 21, 21, 22, 22, 23, 23, 24, 24, 25, 25, 26, 26, 27, 27, 28, 28, 29, 29, 30, 30, 31, 31, 32, 32, 33, 33, 34, 34, 35, 35, 36, 36, 37, 37, 38

Offset: 0

Reinhard Zumkeller, Aug 05 2005

The number of partitions of 2n into exactly 2 odd parts. - Wesley Ivan Hurt, Jun 01 2013
Number of nonisomorphic outer planar graphs of order n >= 3 and size n+1. - Christian Barrientos and Sarah Minion, Feb 27 2018
Also the clique covering number of the n-dipyramidal graph for n >= 3. - Eric W. Weisstein, Jun 27 2018

			G.f. = x + x^2 + 2*x^3 + 2*x^4 + 3*x^5 + 3*x^6 + 4*x^7 + 4*x^8 + 5*x^9 + ...

Charles R Greathouse IV, Table of n, a(n) for n = 0..10000
Eric Weisstein's World of Mathematics, Clique Covering Number
Eric Weisstein's World of Mathematics, Dipyramidal Graph
Wikipedia, Floor and ceiling functions
Index entries for linear recurrences with constant coefficients, signature (1,1,-1).

Essentially the same sequence as A008619 and A123108.
Cf. A014557, A275416 (multisets).
Cf. A298648 (number of smallest coverings of dipyramidal graphs by maximal cliques).

a110654 = (`div` 2) . (+ 1)
a110654_list = tail a004526_list  -- Reinhard Zumkeller, Jul 27 2012

[Ceiling(n/2): n in [0..80]]; // Vincenzo Librandi, Nov 04 2014

a[ n_] := Ceiling[ n / 2]; (* Michael Somos, Jun 15 2014 *)
a[ n_] := Quotient[ n, 2, -1]; (* Michael Somos, Jun 15 2014 *)
a[0] = 0; a[n_] := a[n] = n - a[n - 1]; Table[a[n], {n, 0, 100}] (* Carlos Eduardo Olivieri, Dec 22 2014 *)
CoefficientList[Series[x^/(1 - x - x^2 + x^3), {x, 0, 75}], x] (* Robert G. Wilson v, Feb 05 2015 *)
LinearRecurrence[{1, 1, -1}, {0, 1, 1}, 75] (* Robert G. Wilson v, Feb 05 2015 *)

PARI
```
a(n)=n\2+n%2;
```

a(n)=(n+1)\2; \\ M. F. Hasler, Nov 17 2008

def A110654(n): return n+1>>1 # Chai Wah Wu, Jun 27 2025

[floor(n/2) + 1 for n in range(-1,75)] # Zerinvary Lajos, Dec 01 2009

a(n) = floor(n/2) + n mod 2.
a(n) = A004526(n+1) = A001057(n)*(-1)^(n+1).
For n > 0: a(n) = A008619(n-1).
A110655(n) = a(a(n)), A110656(n) = a(a(a(n))).
a(n) = A109613(n) - A028242(n) = A110660(n) / A028242(n).
a(n) = A001222(A029744(n)). - Reinhard Zumkeller, Feb 16 2006
a(n) = a(n-1) + a(n-2) - a(n-3) for n > 2, a(2) = a(1) = 1, a(0) = 0. - Reinhard Zumkeller, May 22 2006
First differences of quarter-squares: a(n) = A002620(n+1) - A002620(n). - Reinhard Zumkeller, Aug 06 2009
a(n) = A007742(n) - A173511(n). - Reinhard Zumkeller, Feb 20 2010
a(n) = A000217(n) / A008619(n). - Reinhard Zumkeller, Aug 24 2011
From Michael Somos, Sep 19 2006: (Start)
Euler transform of length 2 sequence [1, 1].
G.f.: x/((1-x)*(1-x^2)).
a(-1-n) = -a(n). (End)
a(n) = floor((n+1)/2) = |Sum_{m=1..n} Sum_{k=1..m} (-1)^k|, where |x| is the absolute value of x. - William A. Tedeschi, Mar 21 2008
a(n) = A065033(n) for n > 0. - R. J. Mathar, Aug 18 2008
a(n) = ceiling(n/2) = smallest integer >= n/2. - M. F. Hasler, Nov 17 2008
If n is zero then a(n) is zero, else a(n) = a(n-1) + (n mod 2). - R. J. Cano, Jun 15 2014
G.f. A(x) satisfies 0 = f(A(x), A(x^2)) where f(u, v) = (1 + x) * u * v - (u^2 - v) / 2. - Michael Somos, Jun 15 2014
Given g.f. A(x) then 2 * x^3 * (1 + x) * A(x) * A(x^2) is the g.f. of A014557. - Michael Somos, Jun 15 2014
a(n) = (n + (n mod 2)) / 2. - Fred Daniel Kline, Jun 08 2016
E.g.f.: (sinh(x) + x*exp(x))/2. - Ilya Gutkovskiy, Jun 08 2016
Satisfies the nested recurrence a(n) = a(a(n-2)) + a(n-a(n-1)) with a(1) = a(2) = 1. Cf. A004001. - Peter Bala, Aug 30 2022

Deleted wrong formula and added formula. - M. F. Hasler, Nov 17 2008

A007742 a(n) = n(4n+1).

Original entry on oeis.org

0, 5, 18, 39, 68, 105, 150, 203, 264, 333, 410, 495, 588, 689, 798, 915, 1040, 1173, 1314, 1463, 1620, 1785, 1958, 2139, 2328, 2525, 2730, 2943, 3164, 3393, 3630, 3875, 4128, 4389, 4658, 4935, 5220, 5513, 5814, 6123, 6440, 6765, 7098, 7439, 7788, 8145

Offset: 0

N. J. A. Sloane

Write 0,1,2,... in a clockwise spiral; sequence gives the numbers that fall on the positive y-axis. (See Example section.)
Central terms of the triangle in A126890. - Reinhard Zumkeller, Dec 30 2006
a(n)*Pi is the total length of 4 points circle center spiral after n rotations. The spiral length at each rotation (L(n)) is A004770. The spiral length ratio rounded down [floor(L(n)/L(1))] is A047497. See illustration in links. - Kival Ngaokrajang, Dec 27 2013
For n >= 1, the continued fraction expansion of sqrt(a(n)) is [2n; {4, 4n}]. For n=1, this collapses to [2, {4}]. - Magus K. Chu, Sep 15 2022

			Part of the spiral:
.
  64--65--66--67--68
   |
  63  36--37--38--39--40--41--42
   |   |                       |
  62  35  16--17--18--19--20  43
   |   |   |               |   |
  61  34  15   4---5---6  21  44
   |   |   |   |       |   |   |
  60  33  14   3   0   7  22  45
   |   |   |   |   |   |   |   |
  59  32  13   2---1   8  23  46
   |   |   |           |   |   |
  58  31  12--11--10---9  24  47
   |   |                   |   |
  57  30--29--28--27--26--25  48
   |                           |
  56--55--54--53--52--51--50--49

S. M. Ellerstein, The square spiral, J. Recreational Mathematics 29 (#3, 1998) 188; 30 (#4, 1999-2000), 246-250.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 2nd ed., 1994, p. 99.

Vincenzo Librandi, Table of n, a(n) for n = 0..10000
Emilio Apricena, A version of the Ulam spiral
Robert FERREOL, Illustration by pentagons
Kival Ngaokrajang, Illustration of 4 points circle center spiral
Leo Tavares, Illustration: Triangular Layers
G. Thimm, Emails to N. J. A. Sloane, Sep. 1994
Index entries for linear recurrences with constant coefficients, signature (3,-3,1).

Cf. A033991, A074378.
Sequences from spirals: A001107, A002939, A007742, A033951, A033952, A033953, A033954, A033989, A033990, A033991, A002943, A033996, A033988.
Sequences on the four axes of the square spiral: Starting at 0: A001107, A033991, A007742, A033954; starting at 1: A054552, A054556, A054567, A033951.
Sequences on the four diagonals of the square spiral: Starting at 0: A002939 = 2*A000384, A016742 = 4*A000290, A002943 = 2*A014105, A033996 = 8*A000217; starting at 1: A054554, A053755, A054569, A016754.
Sequences obtained by reading alternate terms on the X and Y axes and the two main diagonals of the square spiral: Starting at 0: A035608, A156859, A002378 = 2*A000217, A137932 = 4*A002620; starting at 1: A317186, A267682, A002061, A080335.
Cf. index to sequences with numbers of the form n*(d*n+10-d)/2 in A140090.
Cf. A081266.

I:=[0, 5, 18]; [n le 3 select I[n] else 3*Self(n-1)-3*Self(n-2)+1*Self(n-3): n in [1..50]]; // Vincenzo Librandi, Jan 29 2012

LinearRecurrence[{3,-3,1},{0,5,18},50] (* Vincenzo Librandi, Jan 29 2012 *)
Table[n(4n+1),{n,0,50}] (* Harvey P. Dale, Aug 10 2017 *)

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

G.f.: x*(5+3*x)/(1-x)^3. - Michael Somos, Mar 03 2003
a(n) = A033991(-n) = A074378(2*n).
a(n) = floor((n + 1/4)^2). - Reinhard Zumkeller, Feb 20 2010
a(n) = A110654(n) + A173511(n) = A002943(n) - n. - Reinhard Zumkeller, Feb 20 2010
a(n) = 8*n + a(n-1) - 3. - Vincenzo Librandi, Nov 21 2010
Sum_{n>=1} 1/a(n) = Sum_{k>=0} (-1)^k*zeta(2+k)/4^(k+1) = 0.349762131... . - R. J. Mathar, Jul 10 2012
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2, a(0)=0, a(1)=5, a(2)=18. - Philippe Deléham, Mar 26 2013
a(n) = A118729(8n+4). - Philippe Deléham, Mar 26 2013
a(n) = A000217(3*n) - A000217(n). - Bruno Berselli, Sep 21 2016
E.g.f.: (4*x^2 + 5*x)*exp(x). - G. C. Greubel, Jul 17 2017
From Amiram Eldar, Jul 03 2020: (Start)
Sum_{n>=1} 1/a(n) = 4 - Pi/2 - 3*log(2).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi/sqrt(2) + log(2) + sqrt(2)*log(1 + sqrt(2)) - 4. (End)
a(n) = A081266(n) - A000217(n). - Leo Tavares, Mar 25 2022

A157474 a(n) = 16n^2 + n.

Original entry on oeis.org

17, 66, 147, 260, 405, 582, 791, 1032, 1305, 1610, 1947, 2316, 2717, 3150, 3615, 4112, 4641, 5202, 5795, 6420, 7077, 7766, 8487, 9240, 10025, 10842, 11691, 12572, 13485, 14430, 15407, 16416, 17457, 18530, 19635, 20772, 21941, 23142, 24375, 25640

Offset: 1

Vincenzo Librandi, Mar 01 2009

The identity (2048*n^2+128*n+1)^2 - (16*n^2+n)*(512*n+16)^2 = 1 can be written as A157476(n)^2 - a(n)*A157475(n)^2 = 1 (see also second comment in A157476).

Sequence found by reading the line from 17, in the direction 17, 66,... in the square spiral whose vertices are the generalized decagonal numbers A074377. - Omar E. Pol, Nov 02 2012

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

Cf. A157475, A157476.

[16*n^2 + n: n in [1..40]]; // Vincenzo Librandi, Jan 01 2015

Table[16n^2+n,{n,50}] (* or *) LinearRecurrence[{3,-3,1},{17,66,147},50] (* Harvey P. Dale, Nov 08 2011 *)
CoefficientList[Series[(17 + 14 x + 3 x^2 - 3 x^3 + x^4) / (1-x)^3, {x, 0, 40}], x] (* Vincenzo Librandi, Jan 01 2015 *)

a(n)=16*n^2+n \\ Charles R Greathouse IV, Feb 09 2012

a(n) = A173511(2*n). - Reinhard Zumkeller, Feb 20 2010
a(1)=17, a(2)=66, a(3)=147, a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3). - Harvey P. Dale, Nov 08 2011
G.f.: x*(17 + 14*x + 3*x^2 - 3*x^3 + x^4)/(1-x)^3. - Vincenzo Librandi, Jan 01 2015

Comment rewritten by Bruno Berselli, Aug 22 2011

cp's OEIS Frontend

A007494 Numbers that are congruent to 0 or 2 mod 3.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

A002943 a(n) = 2*n*(2*n+1).

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

PARI

Formula

Extensions

A110654 a(n) = ceiling(n/2), or: a(2*k) = k, a(2*k+1) = k+1.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

PARI

Python

Sage

Formula

Extensions

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

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A157474 a(n) = 16n^2 + n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

Extensions

A173512 a(n) = 8*n + 4 + n mod 2.

Views

A002943 a(n) = 2n(2*n+1).

A110654 a(n) = ceiling(n/2), or: a(2k) = k, a(2k+1) = k+1.

A007742 a(n) = n(4n+1).