|
Search: id:A049548
|
|
|
| A049548 |
|
a(n+1) = smallest number not containing any digits of a(n), working in base 4. |
|
+0
1
|
|
| 0, 1, 2, 3, 4, 10, 12, 21, 32, 53, 128, 213, 512, 853, 2048, 3413, 8192, 13653, 32768, 54613, 131072, 218453, 524288, 873813, 2097152, 3495253, 8388608, 13981013, 33554432, 55924053, 134217728, 223696213, 536870912, 894784853, 2147483648
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
FORMULA
|
For n>9, a(n)=4*a(n-2) + (a(n-2) mod 4)
|
|
EXAMPLE
|
Written in base 4 the sequence appears as 0, 1, 2, 3, 10, 22, 30, 111, 200, 311, 2000, 3111, 20000, 31111, 200000, 311111, 2000000, 3111111, etc. So a(9)=311 base 4 =53 base 10
|
|
CROSSREFS
|
Cf. A030283, A030439.
Sequence in context: A023725 A076079 A134170 this_sequence A005456 A100773 A131120
Adjacent sequences: A049545 A049546 A049547 this_sequence A049549 A049550 A049551
|
|
KEYWORD
|
base,easy,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Dec 28 2000
|
|
|
Search completed in 0.002 seconds
|
