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.

A333648 Bemirp gaps: differences between consecutive bemirps.

Original entry on oeis.org

30, 510, 300, 8160, 30, 5910, 3000, 87860, 3030, 58710, 30300, 907980, 3000, 496200, 199980, 3030, 76920, 3000, 20070, 8897800, 3000, 251930, 30000, 517870, 89010, 117320, 3000, 87970, 61980, 4092720, 36980, 68020, 522380, 191620, 106230, 1621950, 7200, 620
Offset: 1

Views

Author

Metin Sariyar, Mar 31 2020

Keywords

Comments

The smallest gap is 10 = 16611666611 - 16611666601 and all terms are divisible by 10 as a result of the rule that all bemirps have to end with 1. Bemirp pairs with a gap 10 are 16611666601, 16611666611, 19911999901, 19911999911, ... .

Examples

			a(1) = 1091 - 1061 = 30.
		

Crossrefs

Programs

  • Mathematica
    A048895 = Cases[Import["https://oeis.org/A048895/b048895.txt", "Table"], {, }][[All, 2]];a[n_] :=  A048895[[n+1]]-A048895[[n]];a /@ Range[1,100] (* based on A048895 b-file *)

Formula

a(n) = A048895(n+1) - A048895(n).