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.

A051068 Partial sums of A014578.

Original entry on oeis.org

0, 1, 2, 2, 3, 4, 4, 5, 6, 7, 8, 9, 9, 10, 11, 11, 12, 13, 14, 15, 16, 16, 17, 18, 18, 19, 20, 20, 21, 22, 22, 23, 24, 24, 25, 26, 27, 28, 29, 29, 30, 31, 31, 32, 33, 34, 35, 36, 36, 37, 38, 38, 39, 40, 40, 41, 42, 42, 43, 44, 44, 45, 46, 47, 48, 49, 49
Offset: 0

Views

Author

Keywords

Comments

Duplicate of A050294? [Joerg Arndt, Apr 27 2013]
From Michel Dekking, Feb 10 2019: (Start)
The answer to Joerg Arndt's question is: yes (modulo an offset). To see this, it suffices to prove that the two sequences of first differences Da and Db of a= A051068 and b:=A050294 are equal. Clearly the sequence Da of first differences of a is the sequence A014578. According to Philippe Deleham (2004), Da equals 0x = 0110110111110..., where x is the fixed point of the morphism 0->111, 1->110.
From Vladimir Shevelev (2011) we know a formula for b=A050294: b(n) = n-b(floor(n/3)). This gives that the sequence of first differences Db:=(b(n+1)-b(n)) of b satisfies
Db(3m+1) = Db(3m+2) = 1, and Db(3m+3) = 1 - Db(m).
This implies that Db = x, the fixed point of 0->111, 1->110.
(End)

Crossrefs

Formula

a(3^n) = A015518(n+1) = -(-1)^n*A014983(n+1). - Philippe Deléham, Mar 31 2004

A157282 Maximum cardinality of a weakly triple-free subset of {1, 2, ..., n}.

Original entry on oeis.org

1, 2, 2, 3, 4, 5, 6, 7, 7, 8, 9, 10, 11, 12, 12, 13, 14, 14, 15, 16, 16, 17, 18, 19, 20, 21, 21, 22, 23, 24, 25, 26, 26, 27, 28, 29, 30, 31, 31, 32, 33, 34, 35, 36, 36, 37, 38, 39, 40, 41, 41, 42, 43, 43, 44, 45, 45, 46, 47, 48, 49, 50, 50, 51, 52, 53, 54, 55, 55, 56, 57, 58, 59
Offset: 1

Views

Author

Steven Finch, Feb 26 2009

Keywords

Comments

A050294 is different from this sequence. A050294 involves sets encompassing no {x,3x}; this sequence involves sets encompassing no {x,2x,3x}.
From Steven Finch, Feb 27 2009: (Start)
Define d(n)=A003586(n), b(0)=0 and b(k)=A057561(n) for d(n) <= k < d(n+1).
Then a(n) = Sum_{m=1..ceiling(n/3)} b(floor(n/e(m))) where e(m) = A007310(m). (End)

Examples

			a(9)=7 since there are three grid graphs, two with a single vertex {7}, {5} and the other with rows {1,3,9}, {2,6}, {4}, {8}. The upper triangles are removed by marking 2, 3.
		

Crossrefs

A050296 is the strongly triple-free analog of this sequence.

Extensions

More terms from Steven Finch, Feb 27 2009
Showing 1-2 of 2 results.