cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-10 of 14 results. Next

A028896 6 times triangular numbers: a(n) = 3*n*(n+1).

Original entry on oeis.org

0, 6, 18, 36, 60, 90, 126, 168, 216, 270, 330, 396, 468, 546, 630, 720, 816, 918, 1026, 1140, 1260, 1386, 1518, 1656, 1800, 1950, 2106, 2268, 2436, 2610, 2790, 2976, 3168, 3366, 3570, 3780, 3996, 4218, 4446, 4680, 4920, 5166, 5418, 5676
Offset: 0

Views

Author

Joe Keane (jgk(AT)jgk.org), Dec 11 1999

Keywords

Comments

From Floor van Lamoen, Jul 21 2001: (Start)
Write 1,2,3,4,... in a hexagonal spiral around 0; then a(n) is the sequence found by reading the line from 0 in the direction 0, 6, ...
The spiral begins:
85--84--83--82--81--80
/ \
86 56--55--54--53--52 79
/ / \ \
87 57 33--32--31--30 51 78
/ / / \ \ \
88 58 34 16--15--14 29 50 77
/ / / / \ \ \ \
89 59 35 17 5---4 13 28 49 76
/ / / / / \ \ \ \ \
<==90==60==36==18===6===0 3 12 27 48 75
/ / / / / / / / / /
61 37 19 7 1---2 11 26 47 74
\ \ \ \ / / / /
62 38 20 8---9--10 25 46 73
\ \ \ / / /
63 39 21--22--23--24 45 72
\ \ / /
64 40--41--42--43--44 71
\ /
65--66--67--68--69--70
(End)
If Y is a 4-subset of an n-set X then, for n >= 5, a(n-5) is the number of (n-4)-subsets of X having exactly two elements in common with Y. - Milan Janjic, Dec 28 2007
a(n) is the maximal number of points of intersection of n+1 distinct triangles drawn in the plane. For example, two triangles can intersect in at most a(1) = 6 points (as illustrated in the Star of David configuration). - Terry Stickels (Terrystickels(AT)aol.com), Jul 12 2008
Also sequence found by reading the line from 0, in the direction 0, 6, ... and the same line from 0, in the direction 0, 18, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. Axis perpendicular to A195143 in the same spiral. - Omar E. Pol, Sep 18 2011
Partial sums of A008588. - R. J. Mathar, Aug 28 2014
Also the number of 5-cycles in the (n+5)-triangular honeycomb acute knight graph. - Eric W. Weisstein, Jul 27 2017
a(n-4) is the maximum irregularity over all maximal 3-degenerate graphs with n vertices. The extremal graphs are 3-stars (K_3 joined to n-3 independent vertices). (The irregularity of a graph is the sum of the differences between the degrees over all edges of the graph.) - Allan Bickle, May 29 2023

Crossrefs

Cf. A002378 (3-cycles in triangular honeycomb acute knight graph), A045943 (4-cycles), A152773 (6-cycles).
Cf. A007531.
The partial sums give A007531. - Leo Tavares, Jan 22 2022
Cf. A002378, A046092, A028896 (irregularities of maximal k-degenerate graphs).

Programs

Formula

O.g.f.: 6*x/(1 - x)^3.
E.g.f.: 3*x*(x + 2)*exp(x). - G. C. Greubel, Aug 19 2017
a(n) = 6*A000217(n).
a(n) = polygorial(3, n+1). - Daniel Dockery (peritus(AT)gmail.com), Jun 16 2003
From Zerinvary Lajos, Mar 06 2007: (Start)
a(n) = A049598(n)/2.
a(n) = A124080(n) - A046092(n).
a(n) = A033996(n) - A002378(n). (End)
a(n) = A002378(n)*3 = A045943(n)*2. - Omar E. Pol, Dec 12 2008
a(n) = a(n-1) + 6*n for n>0, a(0)=0. - Vincenzo Librandi, Aug 05 2010
a(n) = A003215(n) - 1. - Omar E. Pol, Oct 03 2011
From Philippe Deléham, Mar 26 2013: (Start)
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n>2, a(0)=0, a(1)=6, a(2)=18.
a(n) = A174709(6*n + 5). (End)
a(n) = A049450(n) + 4*n. - Lear Young, Apr 24 2014
a(n) = Sum_{i = n..2*n} 2*i. - Bruno Berselli, Feb 14 2018
a(n) = A320047(1, n, 1). - Kolosov Petro, Oct 04 2018
a(n) = T(3*n) - T(2*n-2) + T(n-2), where T(n) = A000217(n). In general, T(k)*T(n) = Sum_{i=0..k-1} (-1)^i*T((k-i)*(n-i)). - Charlie Marion, Dec 04 2020
From Amiram Eldar, Feb 15 2022: (Start)
Sum_{n>=1} 1/a(n) = 1/3.
Sum_{n>=1} (-1)^(n+1)/a(n) = 2*log(2)/3 - 1/3. (End)
From Amiram Eldar, Feb 21 2023: (Start)
Product_{n>=1} (1 - 1/a(n)) = -(3/Pi)*cos(sqrt(7/3)*Pi/2).
Product_{n>=1} (1 + 1/a(n)) = (3/Pi)*cosh(Pi/(2*sqrt(3))). (End)

A195040 Square array read by antidiagonals with T(n,k) = k*n^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

Views

Author

Omar E. Pol, Sep 27 2011

Keywords

Comments

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.

Examples

			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, ...
  ...
		

Crossrefs

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).

Programs

  • GAP
    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
  • Maple
    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
  • Mathematica
    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 *)

A091998 Numbers that are congruent to {1, 11} mod 12.

Original entry on oeis.org

1, 11, 13, 23, 25, 35, 37, 47, 49, 59, 61, 71, 73, 83, 85, 95, 97, 107, 109, 119, 121, 131, 133, 143, 145, 155, 157, 167, 169, 179, 181, 191, 193, 203, 205, 215, 217, 227, 229, 239, 241, 251, 253, 263, 265, 275, 277, 287, 289, 299, 301, 311, 313, 323, 325, 335
Offset: 1

Views

Author

Ray Chandler, Feb 21 2004

Keywords

Comments

Cf. property described by Gary Detlefs in A113801: more generally, these numbers are of the form (2*h*n + (h-4)*(-1)^n-h)/4 (h and n in A000027), then ((2*h*n + (h-4)*(-1)^n - h)/4)^2 - 1 == 0 (mod h); in our case, a(n)^2 - 1 == 0 (mod 12). Also a(n)^2 - 1 == 0 (mod 24).

Crossrefs

First row of A092260.
Cf. A175885 (n == 1 or 10 (mod 11)), A175886 (n == 1 or 12 (mod 13)).
Cf. A097933 (primes), A195143 (partial sums).

Programs

  • Haskell
    a091998 n = a091998_list !! (n-1)
    a091998_list = 1 : 11 : map (+ 12) a091998_list
    -- Reinhard Zumkeller, Jan 07 2012
    
  • Magma
    [ n: n in [1..350] | n mod 12 eq 1 or n mod 12 eq 11 ];
    
  • Mathematica
    LinearRecurrence[{1,1,-1},{1,11,13},100] (* Harvey P. Dale, Jul 26 2017 *)
  • PARI
    is(n)=n=n%12;n==11 || n==1 \\ Charles R Greathouse IV, Jul 02 2013

Formula

a(n) = 12*n - a(n-1) - 12 (with a(1)=1). - Vincenzo Librandi, Nov 16 2010
a(n) = 6*n + 2*(-1)^n - 3.
G.f.: x*(1+10*x+x^2)/((1+x)*(1-x)^2).
a(n) - a(n-1) - a(n-2) + a(n-3) = 0 for n > 3.
a(n) = a(n-2) + 12 for n > 2.
a(n) = 12*A000217(n-1) + 1 - 2*Sum_{i=1..n-1} a(i) for n > 1.
Sum_{n>=1} (-1)^(n+1)/a(n) = (2 + sqrt(3))*Pi/12. - Amiram Eldar, Dec 04 2021
E.g.f.: 1 + (6*x - 3)*exp(x) + 2*exp(-x). - David Lovler, Sep 04 2022
From Amiram Eldar, Nov 23 2024: (Start)
Product_{n>=1} (1 - (-1)^n/a(n)) = sqrt(2 + sqrt(3)) = 2*cos(Pi/12) (A188887).
Product_{n>=2} (1 + (-1)^n/a(n)) = (Pi/3)*cos(Pi/12). (End)

Extensions

Formulae and comment added by Bruno Berselli, Nov 17 2010 - Nov 18 2010

A135453 a(n) = 12*n^2.

Original entry on oeis.org

0, 12, 48, 108, 192, 300, 432, 588, 768, 972, 1200, 1452, 1728, 2028, 2352, 2700, 3072, 3468, 3888, 4332, 4800, 5292, 5808, 6348, 6912, 7500, 8112, 8748, 9408, 10092, 10800, 11532, 12288, 13068, 13872, 14700, 15552, 16428, 17328, 18252, 19200, 20172, 21168, 22188
Offset: 0

Views

Author

Ben Paul Thurston, Dec 14 2007

Keywords

Comments

Areas of perfect 4:3 rectangles (for n > 0).
Sequence found by reading the line from 0, in the direction 0, 12, ..., in the square spiral whose vertices are the generalized octagonal numbers A001082. Semi-axis opposite to A069190 in the same spiral. - Omar E. Pol, Sep 16 2011
(x,y,z) = (-a(n), 1 + n*a(n), 1 - n*a(n)) are solutions of the Diophantine equation x^3 + 2*y^3 + 2*z^3 = 4. - XU Pingya, Apr 30 2022

Examples

			192 is on the list since 16*12 is a 4:3 rectangle with integer sides and an area of 192.
		

Crossrefs

Programs

Formula

a(n) = 12*A000290(n) = 6*A001105(n) = 4*A033428(n) = 3*A016742(n) = 2*A033581(n). - Omar E. Pol, Dec 13 2008
From Amiram Eldar, Feb 03 2021: (Start)
Sum_{n>=1} 1/a(n) = Pi^2/72 (A086729).
Sum_{n>=1} (-1)^(n+1)/a(n) = Pi^2/144.
Product_{n>=1} (1 + 1/a(n)) = 2*sqrt(3)*sinh(Pi/(2*sqrt(3)))/Pi.
Product_{n>=1} (1 - 1/a(n)) = 2*sqrt(3)*sin(Pi/(2*sqrt(3)))/Pi. (End)
From Elmo R. Oliveira, Nov 30 2024: (Start)
G.f.: 12*x*(1 + x)/(1-x)^3.
E.g.f.: 12*x*(1 + x)*exp(x).
a(n) = n*A008594(n) = A195143(2*n).
a(n) = 3*a(n-1) - 3*a(n-2) + a(n-3) for n > 2. (End)

Extensions

More terms from Stefan Steinerberger, Dec 17 2007
Minor edits from Omar E. Pol, Dec 15 2008

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

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

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

Crossrefs

Programs

  • Haskell
    a195145 n = a195145_list !! n
    a195145_list = scanl (+) 0 a113801_list
    -- Reinhard Zumkeller, Jan 07 2012
  • Magma
    [(14*n^2+5*(-1)^n-5)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011
    
  • Mathematica
    LinearRecurrence[{2, 0, -2, 1}, {0, 1, 14, 29}, 50] (* Amiram Eldar, Jan 16 2023 *)

Formula

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

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

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.

Crossrefs

A195323 and A195318 interleaved.
Cf. A032527, A195049, A195058. Column 22 of A195040. - Omar E. Pol, Sep 29 2011

Programs

Formula

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

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

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.

Crossrefs

A033583 and A069133 interleaved.
Cf. A090771 (first differences).
Column 10 of A195040. - Omar E. Pol, Sep 28 2011

Programs

  • Haskell
    a195142 n = a195142_list !! n
    a195142_list = scanl (+) 0 a090771_list
    -- Reinhard Zumkeller, Jan 07 2012
  • Magma
    [(10*n^2+3*(-1)^n-3)/4: n in [0..50]]; // Vincenzo Librandi, Sep 27 2011
    
  • Mathematica
    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 *)

Formula

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

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

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.

Crossrefs

Programs

Formula

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

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

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.

Crossrefs

A195321 and A195316 interleaved.
Cf. A032527, A195047, A195048. Column 18 of A195040. - Omar E. Pol, Sep 29 2011

Programs

Formula

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

A195148 Concentric 20-gonal numbers.

Original entry on oeis.org

0, 1, 20, 41, 80, 121, 180, 241, 320, 401, 500, 601, 720, 841, 980, 1121, 1280, 1441, 1620, 1801, 2000, 2201, 2420, 2641, 2880, 3121, 3380, 3641, 3920, 4201, 4500, 4801, 5120, 5441, 5780, 6121, 6480, 6841, 7220, 7601, 8000, 8401, 8820, 9241, 9680, 10121
Offset: 0

Views

Author

Omar E. Pol, Sep 17 2011

Keywords

Comments

Concentric icosagonal numbers.
Sequence found by reading the line from 0, in the direction 0, 20, ..., and the same line from 1, in the direction 1, 41, ..., in the square spiral whose vertices are the generalized dodecagonal numbers A195162. Main axis, perpendicular to A124080 in the same spiral.

Crossrefs

A195322 and A195317 interleaved.
Cf. A032527, A195048, A195049. Column 20 of A195040. - Omar E. Pol, Sep 29 2011

Programs

Formula

From Vincenzo Librandi, Sep 27 2011: (Start)
a(n) = 5*n^2 + 2*(-1)^n-2;
a(n) = -a(n-1) + 10*n^2 - 10*n + 1. (End)
G.f.: x*(1+18*x+x^2)/((1+x)*(1-x)^3). - Bruno Berselli, Sep 27 2011
Sum_{n>=1} 1/a(n) = Pi^2/120 + tan(Pi/sqrt(5))*Pi/(8*sqrt(5)). - Amiram Eldar, Jan 17 2023
Showing 1-10 of 14 results. Next