A364379 Greedy Jacobsthal-Niven numbers: numbers that are divisible by the sum of the digits in their representation in Jacobsthal greedy base (A265747).

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, 42, 43, 44, 45, 46, 48, 51, 52, 54, 56, 57, 60, 64, 68, 69, 72, 75, 76, 80, 84, 85, 86, 87, 88, 90, 92, 93, 96, 99, 100, 104, 105, 106, 108, 111, 112, 115, 116, 117, 120

Offset: 1

Author

Amiram Eldar, Jul 21 2023

Keywords

• nonn
• base

Comments

Numbers k such that A265745(k) | k.

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).

Links

• Amiram Eldar, Table of n, a(n) for n = 1..10000

Crossrefs

Cf. A265745, A265747.

Subsequences: A364380, A364381, A364382, A364383.

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.

Programs

Mathematica

greedyJacobNivenQ[n_] := Divisible[n, A265745[n]]; Select[Range[120], greedyJacobNivenQ] (* using A265745[n] *)

PARI

isA364379(n) = !(n % A265745(n)); \\ using A265745(n)