|
| |
|
|
A068505
|
|
Value of n interpreted in base (b+1), where b=A054055(n) is the largest digit in decimal representation of n.
|
|
8
| |
|
|
1, 2, 3, 4, 5, 6, 7, 8, 9, 2, 3, 5, 7, 9, 11, 13, 15, 17, 19, 6, 7, 8, 11, 14, 17, 20, 23, 26, 29, 12, 13, 14, 15, 19, 23, 27, 31, 35, 39, 20, 21, 22, 23, 24, 29, 34, 39, 44, 49, 30, 31, 32, 33, 34, 35, 41, 47, 53, 59, 42, 43, 44, 45, 46, 47, 48, 55, 62, 69, 56, 57, 58, 59, 60, 61
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| a(n) = n iff n is a "9ish number": a(A011539(n)) = A011539(n). [Reinhard Zumkeller, Dec 29 2011]
|
|
|
LINKS
| R. Zumkeller, Table of n, a(n) for n = 1..11000
|
|
|
EXAMPLE
| a(20)=2*3^1+0*1=6, a(21)=2*3^1+1*1=7, a(22)=2*3^1+2*1=8,
a(23)=2*4^1+3*1=11, a(24)=2*5^1+4*1=14, a(25)=2*6^1+5*1=17,
a(26)=2*7^1+6*1=20, a(27)=2*8^1+7*1=23, a(28)=2*9^1+8*1=26,
a(29)=2*10^1+9*1=29, a(30)=3*4^1+0*1=12, a(31)=3*4^1+1*1=13.
|
|
|
PROG
| (Haskell)
import Data.List (unfoldr)
a068505 n = foldl (\v d -> b*v + d) 0 $ reverse $ dds where
b = maximum dds + 1
dds = unfoldr (\x ->
if x == 0 then Nothing else Just $ swap $ divMod x 10) n
-- Reinhard Zumkeller, Dec 29 2011
|
|
|
CROSSREFS
| Sequence in context: A081594 A038506 A091047 * A080719 A049105 A125959
Adjacent sequences: A068502 A068503 A068504 * A068506 A068507 A068508
|
|
|
KEYWORD
| nonn,base,nice
|
|
|
AUTHOR
| Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 11 2002, Feb 23 2008
|
| |
|
|
