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-3 of 3 results.

A124220 Transpose table A123685 then subtract, term by term, from table A047969.

Original entry on oeis.org

0, 1, 0, 0, 2, 0, 1, 1, 4, 0, 0, 5, 5, 8, 0, 1, 2, 23, 19, 16, 0, 0, 8, 18, 101, 65, 32, 0, 1, 3, 58, 110, 431, 211, 64, 0
Offset: 1

Views

Author

Alford Arnold, Oct 29 2006

Keywords

Examples

			Row six of A047969 is 1 9 37 65 31 1
Row six of A123685^T is 0 7 14 46 15 1
so row six of a(n) is 1 2 23 19 16 0
		

Crossrefs

The sequence of row sums is 0 1 2 6 18 61 224 ... = A123639. The sequence of row sums for table A123685 is 1 1 3 8 25 83 299 ... = A123638. The sequence of row sums for table A047969 is 1 2 5 14 43 144 523 ... = A047970

Formula

A124220(n) = A047969(n) - Trn(A123685).

A123684 Alternate A016777(n) with A000027(n).

Original entry on oeis.org

1, 1, 4, 2, 7, 3, 10, 4, 13, 5, 16, 6, 19, 7, 22, 8, 25, 9, 28, 10, 31, 11, 34, 12, 37, 13, 40, 14, 43, 15, 46, 16, 49, 17, 52, 18, 55, 19, 58, 20, 61, 21, 64, 22, 67, 23, 70, 24, 73, 25, 76, 26, 79, 27, 82, 28, 85, 29, 88, 30, 91, 31, 94, 32, 97, 33, 100, 34, 103, 35, 106, 36
Offset: 1

Views

Author

Alford Arnold, Oct 11 2006

Keywords

Comments

a(n) is a diagonal of Table A123685.
The arithmetic average of the first n terms gives the positive integers repeated (A008619). - Philippe Deléham, Nov 20 2013
Images under the modified '3x-1' map: a(n) = n/2 if n is even, (3n-1)/2 if n is odd. (In this sequence, the numbers at even indices n are n/2 [A000027], and the numbers at odd indices n are 3((n-1)/2) + 1 [A016777] = (3n-1)/2.) The latter correspondence interestingly mirrors an insight in David Bařina's 2020 paper (see below), namely that 3(n+1)/2 - 1 = (3n+1)/2. - Kevin Ge, Oct 30 2024

Examples

			The natural numbers begin 1, 2, 3, ... (A000027), the sequence 3*n + 1 begins 1, 4, 7, 10, ... (A016777), therefore A123684 begins 1, 1, 4, 2, 7, 3, 10, ...
1/1 = 1, (1+1)/2 = 1, (1+1+4)/3 = 2, (1+1+4+2)/4 = 2, ... - _Philippe Deléham_, Nov 20 2013
		

Crossrefs

Programs

  • Haskell
    import Data.List (transpose)
    a123684 n = a123684_list !! (n-1)
    a123684_list = concat $ transpose [a016777_list, a000027_list]
    -- Reinhard Zumkeller, Apr 29 2013
    
  • Magma
    &cat[ [ 3*n-2, n ]: n in [1..36] ]; // Klaus Brockhaus, May 12 2007
    
  • Magma
    /* From the fourteenth formula: */ [&+[1+k*(-1)^k: k in [0..n]]: n in [0..80]]; // Bruno Berselli, Jul 16 2013
    
  • Maple
    A123684:=n->n-1/4-(1/2*n-1/4)*(-1)^n: seq(A123684(n), n=1..70); # Wesley Ivan Hurt, Jul 26 2014
  • Mathematica
    CoefficientList[Series[(1 +x +2*x^2)/((1-x)^2*(1+x)^2), {x,0,70}], x] (* Wesley Ivan Hurt, Jul 26 2014 *)
    LinearRecurrence[{0,2,0,-1},{1,1,4,2},80] (* Harvey P. Dale, Apr 14 2025 *)
  • PARI
    print(vector(72, n, if(n%2==0, n/2, (3*n-1)/2))) \\ Klaus Brockhaus, May 12 2007
    
  • PARI
    print(vector(72, n, n-1/4-(1/2*n-1/4)*(-1)^n)); \\ Klaus Brockhaus, May 12 2007
    
  • SageMath
    [(n + (2*n-1)*(n%2))//2 for n in range(1,71)] # G. C. Greubel, Mar 15 2024

Formula

From Klaus Brockhaus, May 12 2007: (Start)
G.f.: x*(1+x+2*x^2)/((1-x)^2*(1+x)^2).
a(n) = (1/4)*(4*n - 1 - (2*n - 1)*(-1)^n).
a(2n-1) = A016777(n-1) = 3(n-1) + 1.
a(2n) = A000027(n) = n.
a(n) = A071045(n-1) + 1.
a(n) = A093005(n) - A093005(n-1) for n > 1.
a(n) = A105638(n+2) - A105638(n+1) for n > 1.
a(n) = A092530(n) - A092530(n-1) - 1.
a(n) = A031878(n+1) - A031878(n) - 1. (End)
a(2*n+1) + a(2*n+2) = A016825(n). - Paul Curtz, Mar 09 2011
a(n)= 2*a(n-2) - a(n-4). - Paul Curtz, Mar 09 2011
From Jaroslav Krizek, Mar 22 2011 (Start):
a(n) = n + a(n-1) for odd n; a(n) = n - A064455(n-1) for even n.
a(n) = A064455(n) - A137501(n).
Abs(a(n) - A064455(n)) = A052928(n). (End)
a(n) = A225126(n) for n > 1. - Reinhard Zumkeller, Apr 29 2013
a(n) = Sum_{k=1..n} (1 + (k-1)*(-1)^(k-1)). - Bruno Berselli, Jul 16 2013
a(n) = n + floor(n/2) for odd n; a(n) = n/2 for even n. - Reinhard Muehlfeld, Jul 25 2014

Extensions

More terms from Klaus Brockhaus, May 12 2007

A167633 Number of ordered n-tuples of positive integers such that the largest value is n and the first value is odd.

Original entry on oeis.org

1, 1, 14, 74, 1363, 13953, 330628, 5094436, 148124741, 3062897555, 105624547606, 2746180200462, 109589993167831, 3435877666633237, 155759360424218888, 5720220913807900808, 290376774291325403401, 12228041680671237910119, 687155830301443577149594
Offset: 1

Views

Author

Alois P. Heinz, Nov 07 2009

Keywords

Examples

			a(3) = 14, because there are 14 ordered 3-tuples of positive integers such that the largest value is 3 and the first value is odd: 113, 123, 131, 132, 133, 311, 312, 313, 321, 322, 323, 331, 332, 333.
		

Crossrefs

Diagonal of A123685. Cf. A047969.

Programs

  • Maple
    a:= n-> (Matrix (`if` (irem(n, 2)=0, [n/2, 0], [1 +(n-1)/2*3, 1])). Matrix ([[2*n-1, 1], [n*(1-n), 0]]) ^(n-1))[1, 2]: seq (a(n), n=1..20);

Formula

a(n) = [x^(n-1)] z/((n*x-1)*((n-1)*x-1)), where z = (n/2*x) if n is even, and z = (1-(n-1)/2*x) else.
Showing 1-3 of 3 results.