|
Search: id:A104233
|
|
|
| A104233 |
|
Sequence of positive integers which have a "compact" representation which uses fewer decimal digits than just writing the number out normally. |
|
+0
1
|
|
| 125, 128, 216, 243, 256, 343, 512, 625, 729, 1000, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1024, 1025, 1026, 1027, 1028, 1029, 1030, 1031, 1032, 1033
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
You are allowed to use the following symbols as well:
( ) grouping
+ addition
- subtraction
* multiplication
/ division
^ exponentiation
Note that 1015 to 1033 are all representable in the form 4^5-d or 4^5+d, where d is a single digit.
The complexity of a number has been defined in several different ways by different authors. See the Index to the OEIS for other definitions. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Apr 02 2005
|
|
REFERENCES
|
R. K. Guy, Some suspiciously simple sequences, Amer. Math. Monthly 93 (1986), 186-190; 94 (1987), 965; 96 (1989), 905.
R. K. Guy, Unsolved Problems Number Theory, Sect. F26.
J. Arias de Reyna, Complejidad de los numeros naturales, Gaceta de la Real Sociedad Matematica Espanola, 3, (2000), 230-250.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Integer Complexity.
|
|
FORMULA
|
complexity(a(n)) < ceiling(log_10(a(n))) for the definition of integer complexity given. - Jonathan Vos Post (jvospost2(AT)yahoo.com), Apr 02 2005
|
|
CROSSREFS
|
Cf. A036057.
Cf. A005245, A003313, A076142, A076091, A061373, A005421, A064097, A005520, A025280, A003037.
Sequence in context: A030678 A028939 A080538 this_sequence A046759 A115938 A126895
Adjacent sequences: A104230 A104231 A104232 this_sequence A104234 A104235 A104236
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jack Brennen (jb(AT)brennen.net), Apr 01 2005
|
|
|
Search completed in 0.002 seconds
|
