Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007448
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007448 Knuth's sequence (or Knuth numbers): a(n+1) = 1 + min ( 2 a[ n/2 ], 3 a[ n/3 ] ).
(Formerly M2276)
+0
5
1, 3, 3, 4, 7, 7, 7, 9, 9, 10, 13, 13, 13, 15, 15, 19, 19, 19, 19, 21, 21, 22, 27, 27, 27, 27, 27, 28, 31, 31, 31, 39, 39, 39, 39, 39, 39, 39, 39, 40, 43, 43, 43, 45, 45, 46, 55, 55, 55, 55, 55, 55, 55, 55, 55, 57, 57, 58, 63, 63, 63, 63, 63, 64, 67, 67, 67, 79, 79, 79, 79 (list; graph; listen)
OFFSET

0,2

REFERENCES

R. L. Graham, D. E. Knuth and O. Patashnik, Concrete Mathematics. Addison-Wesley, Reading, MA, 1990, p. 78.

LINKS

T. D. Noe, Table of n, a(n) for n=0..1000

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

MATHEMATICA

a[1] = 1; a[n_] := a[n] = 1 + Min[ 2a[Ceiling[(n - 1)/2]], 3a[Ceiling[(n - 1)/3]]]; Table[ a[n], {n, 72}] (from Robert G. Wilson v Jan 29 2005)

CROSSREFS

Cf. A002977.

Adjacent sequences: A007445 A007446 A007447 this_sequence A007449 A007450 A007451

Sequence in context: A058660 A059871 A076619 this_sequence A155689 A051263 A058674

KEYWORD

easy,nonn,nice

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 3 22:29 EDT 2009. Contains 160563 sequences.


AT&T Labs Research