Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056796
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056796 Minimal number of steps to get from 0 to n when there are 3 kinds of step: add 1, multiply by 2, multiply by 3. +0
3
0, 1, 2, 2, 3, 4, 3, 4, 4, 3, 4, 5, 4, 5, 5, 5, 5, 6, 4, 5, 5, 5, 6, 7, 5, 6, 6, 4, 5, 6, 5, 6, 6, 6, 7, 8, 5, 6, 6, 6, 6, 7, 6, 7, 7, 6, 7, 8, 6, 7, 7, 7, 7, 8, 5, 6, 6, 6, 7, 8, 6, 7, 7, 6, 7, 8, 7, 8, 8, 8, 9, 10, 6, 7, 7, 7, 7, 8, 7, 8, 7, 5, 6, 7, 6, 7, 8, 7, 8, 9, 6, 7, 8, 7, 8, 9, 7, 8, 8 (list; graph; listen)
OFFSET

0,3

REFERENCES

Proposed by Mark Sapir (msapir(AT)math.vanderbilt.edu), Math. Dept., Vanderbilt University, August 2000.

CROSSREFS

Cf. A056792, A056817.

Adjacent sequences: A056793 A056794 A056795 this_sequence A056797 A056798 A056799

Sequence in context: A014656 A003078 A002308 this_sequence A061295 A081742 A127432

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net), Sep 07 2000

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 October 12 15:26 EDT 2008. Contains 144830 sequences.


AT&T Labs Research