|
Search: id:A055655
|
|
|
| A055655 |
|
Efficient representation of n in "square base" where xyz means 9x+4y+z and z<4, y<9 and x<25 etc. |
|
+0
1
|
|
| 0, 1, 2, 3, 10, 11, 12, 13, 20, 21, 22, 23, 30, 31, 32, 33, 40, 41, 42, 43, 50, 51, 52, 53, 60, 61, 62, 63, 70, 71, 72, 73, 80, 81, 82, 83, 163, 170, 171, 172, 173, 180, 181, 182, 183, 263, 270, 271, 272, 273, 280, 281, 282, 283, 363, 370, 371, 372, 373, 380, 381
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
REFERENCES
|
F. Smarandache, Definitions solved and unsolved problems, conjectures and theorems in number theory and geometry, edited by M. Perez, Xiquan Publishing House, 2000.
|
|
LINKS
|
F. Smarandache, Definitions, Solved and Unsolved Problems, Conjectures, ...
|
|
EXAMPLE
|
a(50)=280 since 2*9+8*4+0*1=50, writing 2000 for 2*25 would be less efficient and writing 195 for 1*9+9*4+5*1 would make the penultimate and ultimate digits too large.
|
|
CROSSREFS
|
Cf. A007961 for greedy representation of n in "square base".
Sequence in context: A123167 A141670 A074068 this_sequence A007090 A102859 A123977
Adjacent sequences: A055652 A055653 A055654 this_sequence A055656 A055657 A055658
|
|
KEYWORD
|
base,nonn
|
|
AUTHOR
|
Henry Bottomley (se16(AT)btinternet.com), Jun 07 2000
|
|
|
Search completed in 0.002 seconds
|
