Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A117151
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A117151 Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(10*n). +0
7
432541, 838861, 865082, 1468007, 1677722, 1730164, 1887437, 2516583, 2726299, 2936014 (list; graph; listen)
OFFSET

1,1

COMMENT

The sequence is based on data computed by N. Clift (neillclift(AT)msn.com).

CROSSREFS

Cf. A115016, A003313 [l(k)], A086878 [l(k)=l(2*k)], A116459 [l(k)=l(3*k], A116460 [l(k)=l(5*k)], A116461 [l(k)=l(6*k)], A116462 [l(k)=l(7*k], A116463[l(k)=l(9*k)].

Sequence in context: A051595 A117318 A085092 this_sequence A163612 A134960 A134888

Adjacent sequences: A117148 A117149 A117150 this_sequence A117152 A117153 A117154

KEYWORD

hard,more,nonn

AUTHOR

Hugo Pfoertner (hugo(AT)pfoertner.org), Mar 07 2006

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 December 7 23:50 EST 2009. Contains 170430 sequences.


AT&T Labs Research