id:A047988 - OEIS Search Results

Search: id:A047988

Displaying 1-1 of 1 results found.

page 1

a(n) = value of n defined as follows: start with n and reach 2 by repeatedly either dividing by d where d <= the square root or by adding or subtracting 1. The division steps are free, but adding or subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.

+0
11

0, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 1, 1, 0, 1, 2, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2, 1, 1, 0, 1, 2, 1, 0, 1, 1, 1, 0, 1, 1, 2, 1, 1, 1, 1, 0, 1, 1, 1, 2, 1, 1, 1, 0, 1, 1, 1, 0, 1, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 2 (list; graph; listen)

	OFFSET	`2,18`
	REFERENCES	`Thomas Kantke, Mathematische Unterhaltungen, Spectrum der Wissenschaft, No. 4, 1993, pp. 11-13.`
	CROSSREFS	`Cf. A047836, A047984-A047987, A048823-A048827.` `Sequence in context: A037802 A037879 A025449 this_sequence A037818 A087116 A033264` `Adjacent sequences: A047985 A047986 A047987 this_sequence A047989 A047990 A047991`
	KEYWORD	`nonn`
	AUTHOR	`Thomas Kantke (bytes.more(AT)ibm.net)`
	EXTENSIONS	`More terms from David W. Wilson (davidwwilson(AT)comcast.net)`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research