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.

A333426 Primorial base Niven numbers: numbers divisible by their sum of digits in primorial base (A276150).

This page as a plain text file.
%I A333426 #17 Jun 22 2024 14:15:12
%S A333426 1,2,4,6,8,9,12,16,18,20,24,25,30,32,33,36,40,42,44,45,48,50,60,64,65,
%T A333426 66,68,70,72,77,84,88,90,92,96,105,108,112,117,120,132,133,136,144,
%U A333426 150,154,156,160,168,180,182,184,189,192,198,200,210,212,213,216,220
%N A333426 Primorial base Niven numbers: numbers divisible by their sum of digits in primorial base (A276150).
%C A333426 Numbers k for which A276086(k) is in A373852. - _Antti Karttunen_, Jun 22 2024
%H A333426 Amiram Eldar, <a href="/A333426/b333426.txt">Table of n, a(n) for n = 1..10000</a>
%H A333426 Wikipedia, <a href="https://en.wikipedia.org/wiki/Mixed_radix#Primorial_number_system">Primorial number system</a>.
%H A333426 <a href="/index/Pri#primorialbase">Index entries for sequences related to primorial base</a>.
%e A333426 1 is a term since A276150(1) = 1 divides 1;
%e A333426 2 is a term since A276150(2) = 1 divides 2;
%t A333426 max = 5; bases = Prime @ Range[max, 1, -1]; nmax = Times @@ bases - 1; sumdig[n_] := Plus @@ IntegerDigits[n, MixedRadix[bases]]; Select[Range[nmax], Divisible[#, sumdig[#]] &]
%o A333426 (PARI) isA333426 = A373834; \\ _Antti Karttunen_, Jun 22 2024
%Y A333426 Cf. A005349, A049345, A049445, A064150, A064438, A064481, A118363, A235168, A276150, A328208, A328212, A373834 (characteristic function)
%Y A333426 Cf. A276086, A333427, A333428, A341433, A347496, A358977, A373833, A373852.
%Y A333426 Positions of 0's in A373832.
%K A333426 nonn
%O A333426 1,2
%A A333426 _Amiram Eldar_, Mar 20 2020