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.

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

Original entry on oeis.org

11, 92, 377, 470, 6351, 6968, 7175, 7268, 7565, 7970, 20337, 20370, 21981, 22008, 25637, 25664, 25691, 27968, 39183, 39210, 42397, 43128, 43149, 48636, 48729, 48756, 49013, 49040, 49067, 49094, 49863, 50080, 50089, 50386, 50413, 50958, 51343, 52242
Offset: 1

Views

Author

Keywords

Comments

a(n)=i => i is the smallest index such that A088568(i)=-n. - Paolo Bonzini, Jul 06 2016.

Crossrefs