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.

A292683 Numbers divisible by themselves with first digit removed (A217657), excluding multiples of 10.

Original entry on oeis.org

11, 12, 15, 21, 22, 24, 25, 31, 32, 33, 35, 36, 41, 42, 44, 45, 48, 51, 52, 55, 61, 62, 63, 64, 65, 66, 71, 72, 75, 77, 81, 82, 84, 85, 88, 91, 92, 93, 95, 96, 99, 101, 102, 104, 105, 125, 201, 202, 204, 205, 208, 225, 301, 302, 303, 304, 305, 306, 312, 315, 325, 375, 401, 402, 404, 405, 408, 416, 425, 501
Offset: 1

Views

Author

M. F. Hasler, Oct 17 2017

Keywords

Comments

Obviously, any term multiplied by 10 would again be a term, so we exclude trailing zeros.
This sequence cannot contain single-digit numbers (which would yield 0 with the initial digit removed), in contrast to A178158 (numbers divisible by every suffix of n) where the condition is vacuously satisfied for single-digit numbers.
416 is the first term in the present sequence which is not in A178158.
See A292684 and A292685 for the (number of) multiples of N = a(n) which have the same property and yield the same ratio N/A217657(N).

Examples

			12 is in the sequence because it is divisible by 2.
416 is in the sequence because it is divisible by 16, 416 = 4*4*25 + 16.
		

Crossrefs

Programs

  • Mathematica
    fQ[n_] := Mod[n, 10] > 0 && Mod[n, n - Quotient[n, 10^Floor@ Log10@ n] 10^Floor@ Log10@ n] == 0; Select[ Range[11, 501], fQ] (* Robert G. Wilson v, Oct 18 2017 *)
    Select[Range[10,550],Mod[#,10]!=0&&Mod[#,FromDigits[Rest[IntegerDigits[#]]]]==0&] (* Harvey P. Dale, Sep 15 2024 *)
  • PARI
    select( is(n)=n%10&&(m=n%10^logint(n,10))&&!(n%m), [0..500])