Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #10 Mar 21 2021 01:05:13
%S 1,2,3,4,5,6,7,10,12,15,16,18,20,24,25,30,32,33,35,36,40,42,44,45,48,
%T 50,54,60,64,65,66,70,77,80,88,90,96,99,100,110,112,120,124,125,126,
%U 130,140,144,145,147,150,156,160,168,170,180,182,184,185,186,190,192
%N Niven numbers in base i-1: numbers that are divisible by the sum of their digits in base i-1.
%C Numbers k that are divisible by A066323(k).
%C Equivalently, Niven numbers in base -4, since A066323(k) is also the sum of the digits of k in base -4.
%H Amiram Eldar, <a href="/A342726/b342726.txt">Table of n, a(n) for n = 1..10000</a>
%H Walter Penney, <a href="http://dx.doi.org/10.1145/321264.321274">A "binary" system for complex numbers</a>, Journal of the ACM, Vol. 12, No. 2 (1965), pp. 247-248.
%e 2 is a term since its representation in base i-1 is 1100 and 1+1+0+0 = 2 is a divisor of 2.
%e 10 is a term since its representation in base i-1 is 111001100 and 1+1+1+0+0+1+1+0+0 = 5 is a divisor of 10.
%t v = {{0, 0, 0, 0}, {0, 0, 0, 1}, {1, 1, 0, 0}, {1, 1, 0, 1}}; q[n_] := Divisible[n, Total[Flatten @ v[[1 + Reverse @ Most[Mod[NestWhileList[(# - Mod[#, 4])/-4 &, n, # != 0 &], 4]]]]]]; Select[Range[200], q]
%Y Cf. A007608, A066321, A066323, A271472, A342725, A342727, A342728, A342729.
%Y Similar sequences: A005349 (decimal), A049445 (binary), A064150 (ternary), A064438 (quaternary), A064481 (base 5), A118363 (factorial), A328208 (Zeckendorf), A328212 (lazy Fibonacci), A331085 (negaFibonacci), A333426 (primorial), A334308 (base phi), A331728 (negabinary), A342426 (base 3/2).
%K nonn,base
%O 1,2
%A _Amiram Eldar_, Mar 19 2021