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.

A243974 Integers n not of form 3m+1 such that for any integer k>0, n*10^k-1 has a divisor in the set { 7, 11, 13, 37 }.

Original entry on oeis.org

10176, 17601, 19361, 25827, 27147, 27686, 35916, 36048, 45462, 47213, 48036, 49248, 54638, 62864, 64184, 64899, 72953, 73085, 82499, 85073, 86285, 93435, 101760, 101936
Offset: 1

Views

Author

Pierre CAMI, Jun 16 2014

Keywords

Comments

For n>24 a(n) = a(n-24) + 111111, the first 24 values are in the data.
If n is of form 3m+1 then n*10^k-1 is always divisible by 3. - Jens Kruse Andersen, Jul 09 2014

Examples

			10176*10^k-1 is divisible by 11 for k of form 6m, 6m+2, 6m+4, by 7 for k of form 6m+1, by 37 for 6m+3 (and also 6m), and by 13 for 6m+5. This covers all k. {7, 11, 13, 37} is called a covering set. - _Jens Kruse Andersen_, Jul 09 2014
		

Crossrefs

Formula

For n > 24, a(n) = a(n-24) + 111111.

Extensions

Definition corrected by Jens Kruse Andersen, Jul 09 2014