|
Search: id:A066400
|
|
|
| A066400 |
|
Smallest values of t arising in Ron Graham's sequence (A006255). |
|
+0
3
|
|
| 1, 3, 3, 1, 3, 3, 3, 4, 1, 4, 3, 3, 3, 5, 4, 1, 3, 3, 3, 3, 3, 3, 3, 3, 1, 4, 5, 4, 3, 3, 3, 3, 5, 4, 4, 1, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 3, 5, 6, 3, 4, 5, 3, 3, 4, 3, 5, 3, 4, 5, 1, 6, 5, 3, 3, 3, 5, 3, 5, 3, 3, 6, 3, 4, 5, 3, 3, 1, 3, 3, 4, 5, 3, 3, 3, 3, 6, 6, 5, 3, 3, 5, 3, 3, 6, 7, 1, 3, 6, 3, 5, 4
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
REFERENCES
|
R. L. Graham, Bijection between integers and composites, Problem 1242, Math. Mag., 60 (1980), 180.
R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 147.
|
|
EXAMPLE
|
a(2) = 3 because the best such sequence is 2,3,6 which has three terms.
|
|
CROSSREFS
|
Cf. A006255, A066401.
Sequence in context: A138071 A111629 A083953 this_sequence A125562 A092040 A110766
Adjacent sequences: A066397 A066398 A066399 this_sequence A066401 A066402 A066403
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, Dec 25, 2001
|
|
EXTENSIONS
|
More terms from John W. Layman (layman(AT)math.vt.edu), Jul 14 2003
More terms from Joshua Zucker (joshua.zucker(AT)stanfordalumni.org), May 18 2006
|
|
|
Search completed in 0.002 seconds
|
