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.
%I A364379 #10 Jul 29 2023 03:21:34 %S A364379 1,2,3,4,5,6,8,9,10,11,12,14,15,16,20,21,22,24,26,27,28,32,33,36,40, %T A364379 42,43,44,45,46,48,51,52,54,56,57,60,64,68,69,72,75,76,80,84,85,86,87, %U A364379 88,90,92,93,96,99,100,104,105,106,108,111,112,115,116,117,120 %N A364379 Greedy Jacobsthal-Niven numbers: numbers that are divisible by the sum of the digits in their representation in Jacobsthal greedy base (A265747). %C A364379 Numbers k such that A265745(k) | k. %C A364379 The positive Jacobsthal numbers, A001045(n) for n >= 1, are terms since their representation in Jacobsthal greedy base is one 1 followed by n-1 0's, so A265745(A001045(n)) = 1 divides A001045(n). %H A364379 Amiram Eldar, <a href="/A364379/b364379.txt">Table of n, a(n) for n = 1..10000</a> %t A364379 greedyJacobNivenQ[n_] := Divisible[n, A265745[n]]; Select[Range[120], greedyJacobNivenQ] (* using A265745[n] *) %o A364379 (PARI) isA364379(n) = !(n % A265745(n)); \\ using A265745(n) %Y A364379 Cf. A265745, A265747. %Y A364379 Subsequences: A364380, A364381, A364382, A364383. %Y A364379 Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342, A352508, A364216. %K A364379 nonn,base %O A364379 1,2 %A A364379 _Amiram Eldar_, Jul 21 2023