|
Search: id:A079498
|
|
|
| A079498 |
|
Let b=3. Sum of digits in base b gives 0 (mod b). |
|
+0
2
|
|
| 5, 7, 11, 13, 15, 19, 21, 26, 29, 31, 33, 37, 39, 44, 45, 50, 52, 55, 57, 62, 63, 68, 70, 74, 76, 78, 83, 85, 87, 91, 93, 98, 99, 104, 106, 109, 111, 116, 117, 122, 124, 128, 130, 132, 135, 140, 142, 146, 148, 150, 154, 156, 161, 163, 165, 170, 171, 176, 178, 182, 184
(list; graph; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
In base 2 this gives the "Evil Numbers" (cf. A001969). One may conjecture that in base b the asymptotic slope will be b and asymptotic density 1/b for each result (mod b). Cases b=31 or b=61 gave considerable number of primes on the sequence.
Positions of 0's in A053838. Cf. A026601.
|
|
EXAMPLE
|
83=(1,0,0,0,2)_3 thus 1+0+0+0+2=3=0 (mod 3).
|
|
MATHEMATICA
|
Ev = Function[{b, x}, vx = IntegerDigits[x, b]; Mod[Apply[Plus, vx], b]]; Seq = Function[{b, n}, Flatten[Position[Table[Ev[b, k], {k, 1, n}], 0]]]; sb = Seq[3, 1000]
|
|
CROSSREFS
|
Cf. A001969.
Sequence in context: A096379 A098761 A113837 this_sequence A035035 A113909 A111906
Adjacent sequences: A079495 A079496 A079497 this_sequence A079499 A079500 A079501
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Carlos Alves (cjsalves(AT)gmail.com), Jan 21 2003
|
|
|
Search completed in 0.002 seconds
|
