|
Search: id:A000452
|
|
|
| A000452 |
|
a(n) is smallest number which avoids any 3-term G.P. |
|
+0
2
|
|
| 1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 26, 27, 29, 30, 31, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 46, 47, 48, 51, 53, 54, 55, 56, 57, 58, 59, 61, 62, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87, 88, 89, 91, 93, 94, 95, 97, 101
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
F. Iacobescu, Smarandache Partition Type and Other Sequences, Bull. Pure Appl. Sciences, Vol. 16E, No. 2 (1997), pp. 237-240.
F. Smarandache, "Properties of the Numbers", University of Craiova Archives, 1975; Arizona State University Special Collections, Tempe, AZ
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems, Hexis, Phoenix, 2006.
|
|
LINKS
|
M. L. Perez et al., eds., Smarandache Notions Journal
F. Smarandache, Sequences of Numbers Involved in Unsolved Problems.
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Sequence in context: A048964 A028749 A028764 this_sequence A047587 A028737 A109423
Adjacent sequences: A000449 A000450 A000451 this_sequence A000453 A000454 A000455
|
|
KEYWORD
|
nonn,nice
|
|
AUTHOR
|
R. Muller
|
|
EXTENSIONS
|
Corrected and extended by David W. Wilson (davidwwilson(AT)comcast.net) Aug 15 1996.
|
|
|
Search completed in 0.002 seconds
|
