The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A333648 Bemirp gaps: differences between consecutive bemirps. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 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, ... . LINKS Table of n, a(n) for n=1..38. FORMULA a(n) = A048895(n+1) - A048895(n). EXAMPLE a(1) = 1091 - 1061 = 30. 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 *) CROSSREFS Cf. A001223, A037010, A048895, A185439. Sequence in context: A060560 A118681 A354446 * A020926 A229563 A022754 Adjacent sequences: A333645 A333646 A333647 * A333649 A333650 A333651 KEYWORD nonn,base,easy AUTHOR Metin Sariyar, Mar 31 2020 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified September 10 07:40 EDT 2024. Contains 375773 sequences. (Running on oeis4.)