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.

A025506 Least k such that first k terms of A006928 contain n more 1's than 2's.

Original entry on oeis.org

2, 1, 4, 31, 256, 797, 824, 857, 1126, 1397, 1496, 1523, 1532, 193139, 193172, 194035, 194044, 195377, 196370, 196379, 198570, 198633, 199148, 199553, 199860, 200285, 201758, 201785, 201794, 205329, 205686, 205713, 205806, 206031, 206064, 206091
Offset: 0

Views

Author

Keywords

Comments

a(n)=i => i is the smallest index such that A088568(i)=n. Because the difference between successive elements of A088568 can only be -1 or 1, the sequence is monotonic increasing except for a(1) < a(0). - Paolo Bonzini, Jul 06 2016

Examples

			 A088568 begins with 1,0,1,2.. 0 appears first at index 2, 1 appears first at index 1, 2 appears first at index 4. - _Paolo Bonzini_, Jul 06 2016
		

Crossrefs

Extensions

Edited by N. J. A. Sloane, Aug 11 2016