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.

A130049 An inductive sum sequence.

Original entry on oeis.org

0, 3, 6, 7, 17, 12, 32, 20, 51, 29, 72, 39, 97, 50, 127, 63, 161, 77, 197, 92, 236, 108, 279, 126, 327, 145, 378, 166, 432, 188, 489, 211, 550, 235, 614, 260, 681, 286, 751, 313, 826, 341, 906, 371, 989, 402, 1074, 435, 1162, 469, 1252, 504, 1347, 540, 1445, 577
Offset: 1

Views

Author

Clark Kimberling, May 03 2007

Keywords

Comments

Complement of A130048. The bisection sequences b(1),b(3),b(5),... and b(2),b(4),b(6),... are strictly increasing, but b(2n)=3.

Examples

			(a(1),a(2),...,a(6))=(1,2,4,5,8,9), so x=4 and b(6)=1+2+4+5=12.
(a(1),a(2),...,a(7))=(1,2,4,5,8,9,10), so y=4 and b(7)=5+8+9+10=32.
		

Crossrefs

Formula

A130049 is the sequence b defined inductively as follows: Let a(1)=1, a(2)=2, b(1)=0, b(2)=3; for n>=3, let x=Floor(n/2) and y=n-x+1. Then a(n)=least positive integer not among a(1),a(2),...,a(n-1), b(1),b(2),...b(n-1) and b(n)=a(1)+a(2)+...+a(x) if n is even, b(n)=a(y)+a(y+1)+...+a(n) if n is odd.

A130048 Complement of inductive sum sequence A130049.

Original entry on oeis.org

1, 2, 4, 5, 8, 9, 10, 11, 13, 14, 15, 16, 18, 19, 21, 22, 23, 24, 25, 26, 27, 28, 30, 31, 33, 34, 35, 36, 37, 38, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76, 78, 79, 80, 81, 82, 83, 84, 85
Offset: 1

Views

Author

Clark Kimberling, May 03 2007

Keywords

Examples

			(a(1),a(2),...,a(6))=(1,2,4,5,8,9), so x=4 and b(6)=1+2+4+5=12.
(a(1),a(2),...,a(7))=(1,2,4,5,8,9,10), so y=4 and b(7)=5+8+9+10=32.
		

Crossrefs

Formula

a(1)=1, a(2)=2, b(1)=0, b(2)=3; for n>=3, let x=Floor(n/2) and y=n-x+1. Then a(n)=least positive integer not among a(1),a(2),...,a(n-1), b(1),b(2),...b(n-1) and b(n)=a(1)+a(2)+...+a(x) if n is even, b(n)=a(y)+a(y+1)+...+a(n) if n is odd.

A130050 A bisection of A120049.

Original entry on oeis.org

3, 7, 12, 20, 29, 39, 50, 63, 77, 92, 108, 126, 145, 166, 188, 211, 235, 260, 286, 313, 341, 371, 402, 435, 469, 504, 540, 577, 615, 655, 696, 738, 781, 825, 870, 916, 963, 1011, 1060, 1112, 1165, 1219, 1274, 1330, 1387, 1445, 1504, 1564, 1625, 1687, 1751
Offset: 1

Views

Author

Clark Kimberling, May 03 2007

Keywords

Comments

The other bisection is A130051; both bisections are strictly increasing.

Crossrefs

Formula

a(n)=b(2n), for n>=1, where b=A130049.
Showing 1-3 of 3 results.