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.

A116320 n times n+8 gives the concatenation of two numbers m and m+4.

Original entry on oeis.org

4, 86, 32762, 67231, 76322, 693956, 900097, 7295105, 9068525, 3664355432, 6335644561, 8015841979, 8419801579, 9900000997, 3252382148828, 6747617851165, 7253863787097, 9474890578438, 9981136514370
Offset: 1

Views

Author

Giovanni Resta, Feb 06 2006

Keywords

Comments

Includes 10^(4*k+2)-10^(3*k+2)+10^(k+1)-3 for k >= 1. - Robert Israel, Jun 20 2018

Crossrefs

Programs

  • Maple
    Res:= NULL: count:= 0:
    for d from 1 while count < 100 do
      R:= sort(select(t -> t^2 + 8*t - 4 > 10^(2*d-1) and t^2+8*t-4 < 10^(2*d), map(t -> rhs(op(t)), [msolve(n^2+8*n-4, 10^d+1)])));
      count := count+nops(R);
      Res:= Res, op(R);
    od:
    Res; # Robert Israel, Jun 20 2018