Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116463
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A116463 Numbers n such that the minimal length of the corresponding shortest addition chain A003313(n)=A003313(9*n). +0
7
233017, 466034, 699051, 932068, 1165085, 1398102, 1864136, 1878713, 1922393, 2330169, 2330170, 2796203, 2796204, 3262237 (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], A117151 [l(k)=l(10*k)].

Sequence in context: A015319 A050998 A128484 this_sequence A015331 A109690 A013905

Adjacent sequences: A116460 A116461 A116462 this_sequence A116464 A116465 A116466

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research