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.

Previous Showing 11-15 of 15 results.

A058962 a(n) = 2^(2*n)*(2*n+1).

Original entry on oeis.org

1, 12, 80, 448, 2304, 11264, 53248, 245760, 1114112, 4980736, 22020096, 96468992, 419430400, 1811939328, 7784628224, 33285996544, 141733920768, 601295421440, 2542620639232, 10720238370816, 45079976738816, 189115999977472, 791648371998720
Offset: 0

Views

Author

N. J. A. Sloane, Jan 13 2001

Keywords

Comments

Denominators in expansion of -1/2*i*Pi+i*arcsin((1+1/4*x^2)/(1-1/4*x^2)), where i=sqrt(-1); numerators are all 1.
Bisection of A001787. That is, a(n) = A001787(2n+1). - Graeme McRae, Jul 12 2006
Denominators of odd terms in expansion of 2*arctanh(s/2); numerators are all 1. - Gerry Martens, Jul 26 2015
Reciprocals of coefficients of Taylor series expansion of sinh(x/2) / (x/2). - Tom Copeland, Feb 03 2016

Crossrefs

Cf. A154920. - Jaume Oliver Lafont, Jan 29 2009
Factor of the LS1[-2,n] matrix coefficients in A160487. - Johannes W. Meijer, May 24 2009

Programs

  • Magma
    [2^(2*n)*(2*n+1) : n in [0..30]]; // Wesley Ivan Hurt, Aug 07 2015
    
  • Mathematica
    a[n_] := 1/SeriesCoefficient[2 ArcTanh[s/2],{s,0,n}]
    Table[a[n], {n, 1, 40, 2}] (* Gerry Martens, Jul 26 2015 *)
    Table[2^(2 n) (2 n + 1), {n, 0, 40}] (* Vincenzo Librandi, Aug 08 2015 *)
    a[ n_] := With[{m = 2 n + 2}, If[ n < 0, -a[-1 - n] 4^(m - 1), m! SeriesCoefficient[ x^2 D[x Sinc[I x]^2, x]/2, {x, 0, m}]]]; (* Michael Somos, Jun 18 2017 *)
  • PARI
    A058962(n)=2^(2*n)*(2*n+1) \\ M. F. Hasler, Aug 11 2015
    
  • PARI
    {a(n) = my(m = 2*n + 2); if( n<0, -a(-1 - n) * 4^(m - 1), m! * polcoeff( x^2 * deriv(x * sinc(I*x + x * O(x^m))^2, x) / 2, m))}; /* Michael Somos, Jun 18 2017 */

Formula

Central terms of the triangle in A118416: a(n) = A118416(2*n+1, n+1) - Reinhard Zumkeller, Apr 27 2006
Sum_{n>=0} 1/a(n) = log(3). - Jaume Oliver Lafont, May 22 2007; corrected by Jaume Oliver Lafont, Jan 26 2009
a(n) = 4((2n+1)/(2n-1))*a(n-1) = 4*a(n-1)+2^(2n+1) = 8*a(n-1)-16*a(n-2). - Jaume Oliver Lafont, Dec 09 2008
G.f.: (1+4*x)/(1-4*x)^2. - Jaume Oliver Lafont, Jan 29 2009
E.g.f.: exp(4*x)*(1+8*x). - Robert Israel, Aug 10 2015
a(n) = -a(-1-n) * 4^(2*n+1) for all n in Z. - Michael Somos, Jun 18 2017
a(n) = Sum_{k = 0..n} (2*k + 1)^2*binomial(2*n + 1, n - k). - Peter Bala, Feb 25 2019
Sum_{n>=0} (-1)^n/a(n) = 2 * arctan(1/2) = 2 * A073000. - Amiram Eldar, Jul 03 2020

A118413 Triangle read by rows: T(n,k) = (2*n-1)*2^(k-1), 0

Original entry on oeis.org

1, 3, 6, 5, 10, 20, 7, 14, 28, 56, 9, 18, 36, 72, 144, 11, 22, 44, 88, 176, 352, 13, 26, 52, 104, 208, 416, 832, 15, 30, 60, 120, 240, 480, 960, 1920, 17, 34, 68, 136, 272, 544, 1088, 2176, 4352, 19, 38, 76, 152, 304, 608, 1216, 2432, 4864, 9728, 21, 42, 84, 168
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 27 2006

Keywords

Comments

Central terms give A118415; row sums give A118414;
T(n,1) = A005408(n-1);
T(n,2) = A016825(n-1) for n>1;
T(n,3) = A017113(n-1) for n>2;
T(n,4) = A051062(n-1) for n>3;
T(n,n-2) = A052951(n-1) for n>2;
T(n,n) = A014480(n-1) = A118416(n,n);
A001511(T(n,k)) = A002260(n,k);
A003602(T(n,k)) = A002024(n,k).
G.f.: x*y*(1 + x + 2*x*y - 6*x^2*y)/((1 - x)^2*(1 - 2*x*y)^2). - Stefano Spezia, Dec 22 2024

Examples

			   1
   3   6
   5  10  20
   7  14  28  56
   9  18  36  72 144
  11  22  44  88 176 352
  13  26  52 104 208 416  832
  15  30  60 120 240 480  960 1920
  17  34  68 136 272 544 1088 2176 4352
  19  38  76 152 304 608 1216 2432 4864 9728
  ...
		

Crossrefs

Programs

  • Mathematica
    Select[Flatten[Table[(2n-1)2^(k-1),{n,20},{k,0,n}]],IntegerQ] (* Harvey P. Dale, Jan 17 2024 *)
  • Python
    from math import isqrt, comb
    def A118413(n):
        a = (m:=isqrt(k:=n<<1))+(k>m*(m+1))
        return ((a<<1)-1)<Chai Wah Wu, Jun 20 2025

A014477 Expansion of (1 + 2*x)/(1 - 2*x)^3.

Original entry on oeis.org

1, 8, 36, 128, 400, 1152, 3136, 8192, 20736, 51200, 123904, 294912, 692224, 1605632, 3686400, 8388608, 18939904, 42467328, 94633984, 209715200, 462422016, 1015021568, 2218786816, 4831838208, 10485760000, 22682796032, 48922361856, 105226698752, 225754218496
Offset: 0

Views

Author

Keywords

Comments

The sequence 0,1,8,... has a(n) = n^2*2^(n-1) and is the binomial transform of the hexagonal numbers A000384 (with leading 0). - Paul Barry, Jun 09 2003
As 0,1,8,... this is n^2*2^(n-1), the binomial transform of the hexagonal numbers A000384 (include the leading 0). Partial sums are A036826. - Paul Barry, Jun 10 2003
Sequence gives total value of all possible sums of distinct odd integers with maximum term less than 2n+1. E.g., for a(3) we can have the sums 1, 3, 5, 1+3, 1+5, 3+5, 1+3+5, which sum to 1+3+5+4+6+8+9 = 36. - Jon Perry, Feb 06 2004
Number of edges on a partially truncated (n+1)-cube (column 2 of A271316).

Crossrefs

Programs

Formula

O.g.f.: (1 + 2*x)/(1 - 2*x)^3 (see the name).
a(n) = (n+1)^2*2^n = A007758(n+1)/2. - Henry Bottomley, Jun 13 2001
The binomial transform of 0, 1, 8, ... is A077616. - Paul Barry, Jul 24 2003
a(1)=1, a(n) = 2a(n-1) + (2n-1)*2^(n-1). - Jon Perry, Feb 06 2004
a(n) = sum of (n+1)-th row of the triangle in A118416. - Reinhard Zumkeller, Apr 27 2006
a(n) = Sum_{j=0..n} binomial(n,j)*n*j. - Zerinvary Lajos, Oct 19 2006
E.g.f.: exp(2*x)*(1 + 6*x + 8*x^2/2!). - Wolfdieter Lang, Jul 29 2017
Sum_{n>=0} 1/a(n) = Pi^2/6 - log(2)^2. - Daniel Suteu, Oct 31 2017
Sum_{n>=0} (-1)^n/a(n) = -2 * Li_2(-1/2) = -2 * A355234. - Amiram Eldar, Oct 01 2022

A117303 Self-inverse permutation of the natural numbers based on the bijection (2*x-1)*2^(y-1) <--> (2*y-1)*2^(x-1).

Original entry on oeis.org

1, 3, 2, 5, 4, 6, 8, 7, 16, 12, 32, 10, 64, 24, 128, 9, 256, 48, 512, 20, 1024, 96, 2048, 14, 4096, 192, 8192, 40, 16384, 384, 32768, 11, 65536, 768, 131072, 80, 262144, 1536, 524288, 28, 1048576, 3072, 2097152, 160, 4194304, 6144, 8388608, 18, 16777216
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 24 2006

Keywords

Comments

a(a(n)) = n; fixed points A014480: a(A014480(n)) = A014480(n). - Reinhard Zumkeller, Apr 27 2006

Crossrefs

Programs

  • Maple
    a:= n-> (j-> (2*j+1)*2^((n/2^j-1)/2))(padic[ordp](n, 2)):
    seq(a(n), n=1..50);  # Alois P. Heinz, Jan 23 2019
  • Mathematica
    a[n_] := (2 IntegerExponent[2 n, 2] - 1)*2^((n/2^IntegerExponent[n, 2] + 1)/2 - 1); Array[a, 50] (* Jean-François Alcover, Mar 12 2019 *)
  • Python
    def A117303(n): return (((m:=(n&-n).bit_length())<<1)-1)*(1<<(n>>m)) # Chai Wah Wu, Jul 14 2022

Formula

a(n) = (2*A001511(n) - 1) * 2^(A003602(n) - 1).

Extensions

Spelling corrected by Jason G. Wurtzel, Aug 23 2010

A118417 a(n) = (2*n + 1) * 2^(n + 1).

Original entry on oeis.org

2, 12, 40, 112, 288, 704, 1664, 3840, 8704, 19456, 43008, 94208, 204800, 442368, 950272, 2031616, 4325376, 9175040, 19398656, 40894464, 85983232, 180355072, 377487360, 788529152, 1644167168, 3422552064, 7113539584, 14763950080, 30601641984, 63350767616
Offset: 0

Views

Author

Reinhard Zumkeller, Apr 27 2006

Keywords

Crossrefs

Programs

  • Magma
    [(2*n+1)*2^(n+1): n in [0..40]]; // Vincenzo Librandi, Dec 26 2010
  • Mathematica
    CoefficientList[Series[2 (1 - 3 x^2 + 2 x^3)/((1 - x)^2 (1 - 2 x)^2), {x, 0, 30}], x] (* Vincenzo Librandi, Sep 02 2016 *)
    Table[(2n+1)2^(n+1),{n,0,30}] (* or *) LinearRecurrence[{4,-4},{2,12},30] (* Harvey P. Dale, Oct 25 2021 *)

Formula

a(n) = A118416(n+1,n) = 2*A014480(n).
G.f.: 2*(1-3*x^2+2*x^3)/((1-x)^2*(1-2*x)^2). - Vincenzo Librandi, Sep 02 2016
Sum_{n>=0} 1/a(n) = A196525. - Fred Daniel Kline, May 24 2019
Sum_{n>=0} (-1)^n/a(n) = arctan(1/sqrt(2))/sqrt(2) = A195695 / A002193. - Amiram Eldar, Oct 01 2022
Previous Showing 11-15 of 15 results.