id:A048823 - OEIS Search Results

Search: id:A048823

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 subtracting 1. The division steps are free, but subtracting 1 costs 1 point. The "value" of n is the smallest cost to reach 2.

+0
3

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

	OFFSET	`2,5`
	CROSSREFS	`Cf. A047988. Same formula except you cannot add 1 (only subtract).` `Adjacent sequences: A048820 A048821 A048822 this_sequence A048824 A048825 A048826` `Sequence in context: A029372 A029377 A128186 this_sequence A025871 A051010 A130027`
	KEYWORD	`nonn`
	AUTHOR	`Christian G. Bower (bowerc(AT)usa.net), May 15 1999.`

page 1

Search completed in 0.002 seconds

Last modified October 11 09:12 EDT 2008. Contains 144832 sequences.

AT&T Labs Research