OFFSET
1,2
COMMENTS
a(n) = A168183(n) for n <= 72.
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[100], DigitCount[#, 9, 0]==0&] (* or *) With[{upto=100}, Complement[ Range[upto], 9*Range[Floor[upto/9]]]] (* Harvey P. Dale, May 29 2019 *)
PROG
(Haskell)
a255808 n = a255808_list !! (n-1)
a255808_list = iterate f 1 where
f x = 1 + if r < 8 then x else 9 * f x' where (x', r) = divMod x 9
(PARI) isok(n) = vecmin(digits(n, 9)) != 0; \\ Michel Marcus, Jun 29 2019
(Python)
def A255808(n):
m = ((k:=7*n+1).bit_length()-1)//3
return sum((1+((k-(1<<3*m))//(7<<3*j)&7))*9**j for j in range(m)) # Chai Wah Wu, Jun 28 2025
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Reinhard Zumkeller, Mar 08 2015
STATUS
approved
