OFFSET
1,2
COMMENTS
A base 8 version of Harshad (or Niven) numbers (A005349).
Numbers n such that n = 0 modulo A053829(n), where the latter sequence gives the sum of digits when n is represented in the octal number system. - Antti Karttunen, Aug 22 2014
LINKS
EXAMPLE
36971 is in the sequence as it is 110153 in octal and 1 + 1 + 0 + 1 + 5 + 3 = 11 which divides 36971.
MATHEMATICA
Select[Range[256], IntegerQ[#/(Plus@@IntegerDigits[#, 8])] &] (* Alonso del Arte, Aug 26 2014 *)
PROG
(Python)
from gmpy2 import digits
A245802 = [n for n in range(1, 10**3) if not n % sum([int(d) for d in digits(n, 8)])]
(MIT/GNU Scheme, with Antti Karttunen's IntSeq-library)
(define (A053829 n) (let loop ((n n) (i 0)) (if (zero? n) i (loop (floor->exact (/ n 8)) (+ i (modulo n 8))))))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Chai Wah Wu, Aug 22 2014
STATUS
approved