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

A142716 First differences of A140495.

Original entry on oeis.org

1, 1, 1, 3, 3, 3, 3, 6, 6, 9, 9, 18, 18, 18, 45, 36, 45, 99, 81, 108, 216, 189, 243, 486, 432, 540, 1107, 972, 1215, 2511, 2187, 2754, 5670, 4941, 6237, 12798, 11178, 14094, 28917, 25272, 31833, 65367, 57105, 71928, 147744, 129033, 162567
Offset: 1

Views

Author

Paul Curtz, Sep 26 2008

Keywords

Formula

3 | a(n), n>3.

A158745 a(3n)=A130750(n). a(3n+1)=A130752(n). a(3n+2)=A130755(n).

Original entry on oeis.org

1, 2, 3, 3, 5, 4, 8, 9, 7, 17, 16, 15, 33, 31, 32, 64, 63, 65, 127, 128, 129, 255, 257, 256, 512, 513, 511, 1025, 1024, 1023, 2049, 2047, 2048, 4096, 4095, 4097, 8191, 8192, 8193, 16383, 16385, 16384, 32768, 32769, 32767, 65537, 65536, 65535, 131073, 131071, 131072, 262144
Offset: 0

Views

Author

Paul Curtz, Mar 25 2009

Keywords

Comments

This mixes three sequences which are identical to their third differences.

Crossrefs

Programs

  • Mathematica
    LinearRecurrence[{0,0,3,0,0,-3,0,0,2},{1,2,3,3,5,4,8,9,7},60] (* Harvey P. Dale, Mar 12 2023 *)

Formula

a(3n)+a(3n+1)+a(3n+2)= A007283(n+1).
a(18n) = A130750(6n)= 2^(6n+1)-1.
a(n) = 3*a(n-3)-3*a(n-6)+2*a(n-9). G.f.: -(1+2*x+3*x^2-x^4-5*x^5+2*x^6+4*x^8)/((2*x^3-1)*(x^6-x^3+1)). - R. J. Mathar, Jan 23 2009

Extensions

Edited and extended by R. J. Mathar, Apr 09 2009
Showing 1-2 of 2 results.