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.

A264938 a(n) = n*(2*n-1) + floor(n/3).

Original entry on oeis.org

0, 1, 6, 16, 29, 46, 68, 93, 122, 156, 193, 234, 280, 329, 382, 440, 501, 566, 636, 709, 786, 868, 953, 1042, 1136, 1233, 1334, 1440, 1549, 1662, 1780, 1901, 2026, 2156, 2289, 2426, 2568, 2713, 2862, 3016, 3173, 3334, 3500, 3669, 3842, 4020, 4201, 4386, 4576, 4769
Offset: 0

Views

Author

Paul Curtz, Nov 29 2015

Keywords

Comments

Sequence extended to the left:
..., 133, 102, 76, 53, 34, 20, 9, 2, 0, 1, 6, 16, 29, 46, 68, 93, ...
Conjecture: after 0, a(n) provides the first bisection of A264041.
Conjecture: 2, 9, 20, 34, 53, 76, 102, 133, ... is A248121.

Crossrefs

Programs

  • Magma
    [n*(2*n-1)+Floor(n/3): n in [0..60]]; // Vincenzo Librandi, Dec 02 2015
  • Maple
    seq(n*(2*n-1) + floor(n/3), n=0..100); # Robert Israel, Dec 02 2015
  • Mathematica
    Table[n (2 n - 1) + Floor[n/3], {n, 0, 50}] (* Vincenzo Librandi, Dec 02 2015 *)
    LinearRecurrence[{2,-1,1,-2,1},{0,1,6,16,29},60] (* Harvey P. Dale, Oct 13 2020 *)
  • PARI
    concat(0, Vec(x*(1+x)^2*(1+2*x)/((1-x)^3*(1+x+x^2)) + O(x^100))) \\ Colin Barker, Dec 02 2015
    
  • PARI
    a(n) = n*(2*n-1) + n\3; \\ Altug Alkan, Dec 01 2015
    

Formula

a(n) = a(n-3) + 12*n - 20 for n>2.
From Colin Barker, Dec 02 2015: (Start)
a(n) = 2*a(n-1) - a(n-2) + a(n-3) - 2*a(n-4) + a(n-5) for n>4.
G.f.: x*(1+x)^2*(1+2*x) / ((1-x)^3*(1+x+x^2)).
(End)
a(n) = A000217(2n-1) + A002264(n).
a(n) + a(-n) = 3*A256320(n).
a(n +8) - a(n -7) = 20*A016777(n).
a(n+16) - a(n-14) = 20*A016969(n).
a(n+23) - a(n-22) = 20*A017197(n).
a(n+31) - a(n-29) = 20*A017641(n).
Generalization of the previous four formulas:
a(n+30*k +8) - a(n-30*k -7) = 20*(4*k+1)*(3*n+1).
a(n+30*k+16) - a(n-30*k-14) = 20*(2*k+1)*(6*n+5).
a(n+30*k+24) - a(n-30*k-21) = 20*(4*k+3)*(3*n+4).
a(n+30*k+32) - a(n-30*k-28) = 20*(2*k+2)*(6*n+11).
E.g.f.: (6*x^2+4*x-1)*exp(x)/3 + (cos(sqrt(3)*x/2)/3 +sqrt(3)*sin(sqrt(3)*x/2)/9)*exp(-x/2). - Robert Israel, Dec 02 2015

Extensions

Edited by Bruno Berselli, Dec 01 2015

A171451 a(n) = 2^C(n, 2) * 2^floor(n/3).

Original entry on oeis.org

1, 1, 2, 16, 128, 2048, 131072, 8388608, 1073741824, 549755813888, 281474976710656, 288230376151711744, 1180591620717411303424, 4835703278458516698824704, 39614081257132168796771975168, 1298074214633706907132624082305024, 42535295865117307932921825928971026432
Offset: 0

Views

Author

Paul Barry, Dec 09 2009

Keywords

Comments

Hankel transform of A171450.

Crossrefs

Programs

  • Mathematica
    Table[2^Binomial[n,2] 2^Floor[n/3],{n,0,20}] (* Harvey P. Dale, Nov 20 2021 *)
  • PARI
    a(n) = 2^(n*(3*n-1)\6); \\ Jinyuan Wang, Feb 25 2020

Formula

a(n) = 2^A171452(n).

Extensions

More terms from Jinyuan Wang, Feb 25 2020

A209634 Triangle with (1,4,7,10,13,16...,(3*n-2),...) in every column, shifted down twice.

Original entry on oeis.org

1, 4, 7, 1, 10, 4, 13, 7, 1, 16, 10, 4, 19, 13, 7, 1, 22, 16, 10, 4, 25, 19, 13, 7, 1, 28, 22, 16, 10, 4, 31, 25, 19, 13, 7, 1, 34, 28, 22, 16, 10, 4, 37, 31, 25, 19, 13, 7, 1, 40, 34, 28, 22, 16, 10, 4, 43, 37, 31, 25, 19, 13, 7, 1, 46, 40, 34, 28, 22, 16, 10
Offset: 1

Views

Author

Ctibor O. Zizka, Mar 11 2012

Keywords

Comments

OEIS contains a lot of similar sequences, for example A152204, A122196, A173284.
Row sums for this sequence gives A006578.
In general, by given triangle with (A-B,2*A-B,...,A*n-B,...) in every column, shifted down K-times, we have the row sum s(n)= A*(n*n+K*n+nmodK)/(2*K) - B*(n+nmodK)/K. In this sequence K=2,A=3,B=2, in A152204 K=2,A=2,B=1.
No triangle with primes in every column, shifted down by K>=2 in OEIS, no row sums of it in OEIS.
From Johannes W. Meijer, Sep 28 2013: (Start)
Triangle read by rows formed from antidiagonals of triangle A143971.
The alternating row sums equal A004524(n+2) + 2*A004524(n+1).
The antidiagonal sums equal A171452(n+1). (End)

Examples

			Triangle:
1
4
7,  1
10, 4
13, 7,  1
16, 10, 4
19, 13, 7,  1
22, 16, 10, 4
25, 19, 13, 7,  1
28, 22, 16, 10, 4
...
		

Crossrefs

Programs

  • Maple
    T := (n, k) -> 3*n - 6*k + 4: seq(seq(T(n, k), k=1..floor((n+1)/2)), n=1..15); # Johannes W. Meijer, Sep 28 2013

Formula

From Johannes W. Meijer, Sep 28 2013: (Start)
T(n, k) = 3*n - 6*k + 4, n >= 1 and 1 <= k <= floor((n+1)/2).
T(n, k) = A143971(n-k+1, k), n >= 1 and 1 <= k <= floor((n+1)/2). (End)
Showing 1-3 of 3 results.