A115016 - OEIS

This site is supported by donations to The OEIS Foundation.

A115016

a(n) = smallest number k that has a shortest addition chain whose length A003313(k) = A003313(n*k), or 0 if this never happens.

1, 191, 171, 30958077, 3277, 2731, 28087 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,2`
	COMMENTS	`Using ? to indicate a term whose value is presently unknown, the sequence reads 1, 191, 171, 30958077, 3277, 2731, 28087, ?, 233017, 432541, 953251, 699051, 12905551, 1797559, ?, ?, ?, ?, 7064091, ... This is based on several years work using a variety of algorithms. - N. Clift, May 23 2008` `It was conjectured that no shortest addition chains exist such that A003313(m)=A003313(m*2^k) for k>1. This is now known to be false, since a(4) != 0.`
	REFERENCES	`For a comprehensive list of references see A003313.` `See also D. E. Knuth, updates to Vol. 2 of TAOCP.`
	LINKS	`Daniel Bleichenbacher, Efficiency and Security of Cryptosystems based on Number Theory. PhD Thesis, Diss. ETH No. 11404, Zuerich 1996; p. 61.`
	EXAMPLE	`a(3)=171 because 171 and 513=3171 both have a shortest addition chain of length 10. 171 and 513 is the smallest pair of numbers with the property A003313(k)=A003313(3k). Examples for the corresponding shortest chains are [1 2 4 5 7 14 19 38 57 114 171] and [1 2 4 8 16 32 64 128 256 512 513].`
	CROSSREFS	`Cf. A003313 [l(k)], A086878 [l(k)=l(2k)], A116459 [l(k)=l(3k)], A116460 [l(k)=l(5k], A116461 [l(k)=l(6k)], A116462 [l(k)=l(7k)], A116463 [l(k)=l(9k], A117151 [l(k)=l(10k)].` `Sequence in context: A206731 A103494 A104642 A160784 A139650 A139977` `Adjacent sequences: A115013 A115014 A115015 * A115017 A115018 A115019`
	KEYWORD	`hard,nonn`
	AUTHOR	`Hugo Pfoertner (hugo(AT)pfoertner.org), Feb 26 2006`
	EXTENSIONS	`a(4) = 30958077 from N. Clift, May 21 2008`

Content is available under The OEIS End-User License Agreement .

Last modified February 14 00:47 EST 2012. Contains 205567 sequences.