A364216 Jacobsthal-Niven numbers: numbers that are divisible by the sum of the digits in their Jacobsthal representation (A280049).

1, 2, 3, 4, 6, 8, 9, 11, 12, 14, 15, 16, 20, 22, 24, 27, 28, 32, 33, 36, 40, 42, 43, 44, 45, 46, 48, 51, 52, 54, 56, 57, 60, 68, 72, 75, 76, 84, 86, 87, 88, 92, 93, 95, 96, 99, 100, 104, 105, 108, 112, 115, 117, 120, 125, 126, 128, 129, 132, 135, 136, 138, 140

Offset: 1

Author

Amiram Eldar, Jul 14 2023

Keywords

• nonn
• base
• easy

Comments

Numbers k such that A364215(k) | k.

A007583 is a subsequence since A364215(A007583(n)) = 1 for n >= 0.

Links

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

Crossrefs

Cf. A280049, A364215.

Subsequences: A007583, A364217, A364218, A364219, A364220, A364221.

Similar sequences: A005349, A049445, A064150, A064438, A064481, A118363, A328208, A328212, A331085, A333426, A342726, A334308, A331728, A342426, A344341, A351714, A351719, A352089, A352107, A352320, A352342, A352508.

Programs

Mathematica

seq[kmax_] := Module[{m = 1, s = {}}, Do[If[Divisible[k, DigitCount[m, 2, 1]], AppendTo[s, k]]; While[m++; OddQ[IntegerExponent[m, 2]]], {k, 1, kmax}]; s]; seq[140]

PARI

lista(kmax) = {my(m = 1); for(k = 1, kmax, if( !(k % sumdigits(m, 2)), print1(k,", ")); until(valuation(m, 2)%2 == 0, m++));}