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.

A133650 Early early bird numbers (early bird numbers of order 2).

Original entry on oeis.org

99, 111, 122, 123, 132, 142, 152, 162, 172, 182, 192, 211, 212, 214, 215, 216, 217, 218, 219, 220, 221, 231, 232, 233, 234, 243, 253, 263, 273, 283, 293, 311, 312, 313, 321, 322, 323, 325, 326, 327, 328, 329, 330, 331, 332, 342, 343, 344, 345, 354, 364, 374
Offset: 1

Views

Author

Klaus Brockhaus, Sep 19 2007

Keywords

Comments

N-th Early bird number A116700(n) is in the sequence if it occurs in the concatenation of the first n-1 early bird numbers, A116700(1), ..., A116700(n-1).
With A116700 as early bird numbers of order 1, this can be generalized to define early bird numbers of order k for k > 1: N-th Early bird number of order k-1 is an early bird number of order k if it occurs in the concatenation of the first n-1 early bird numbers of order k-1.
Inspired by Eric Angelini's posting to Seq Fan mailing list, Jul 23 2007.

Examples

			A116700(45) = 99 occurs in the concatenation 1221233132344142434551525354566162636465677172737475767881828384858687899192939495969798 of A116700(1), ..., A116700(44). Hence 99 is an early bird number of order 2.
		

Crossrefs

Cf. A116700 (early bird numbers), A133651 (early bird numbers of order 3), A133652 (least early bird number of order n).

Programs

  • JBASIC
    REM Program works for order >= 1; set maxterm >= A133652(order).
    order = 2
    maxterm = 374 : dim seq(maxterm), early(maxterm)
    for i = 1 to maxterm : seq(i) = i : next
    for k = 1 to order
    concatenation$ = "" : n = 0
    for j = 1 to maxterm
    term = seq(j) : string$ = str$(term)
    if instr(concatenation$, string$) > 0 then n = n+1 : early(n) = term
    concatenation$ = concatenation$ + string$
    next j
    maxterm = n : redim seq(maxterm)
    for i = 1 to maxterm : seq(i) = early(i) : next
    redim early(maxterm)
    next k
    print "early bird numbers of order "; order
    for i = 1 to maxterm : print seq(i); ","; : next

A133652 Least early bird number of order n.

Original entry on oeis.org

12, 99, 212, 221, 1532, 2211, 4221, 12111, 21111, 22211, 42221, 111107, 121111, 211111, 222216, 878777, 1111102, 1121111, 1211111, 2111111, 4332343, 9999993, 11111051, 11111106, 11211111, 12111111, 21111111
Offset: 1

Views

Author

Klaus Brockhaus, Sep 19 2007

Keywords

Comments

See A133650 for definition of early bird numbers of order n.
a(28) > 6*10^7. [From Donovan Johnson, Nov 06 2010]

Examples

			a(3) = A133651(1) = 212.
		

Crossrefs

Cf. A116700 (early bird numbers), A133650 (early bird numbers of order 2), A133651 (early bird numbers of order 3).

Extensions

a(16)-a(27) from Donovan Johnson, Nov 06 2010
Showing 1-2 of 2 results.