A030530 - OEIS

This site is supported by donations to The OEIS Foundation.

A030530

n appears A070939(n) times.

0, 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 15, 16, 16, 16, 16, 16, 17, 17, 17, 17, 17, 18, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 20, 21, 21, 21 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,3`
	LINKS	`Reinhard Zumkeller, Table of n, a(n) for n = 0..10000`
	PROG	`(Haskell)` `import Data.List (unfoldr)` `a030530 n = a030530_list !! (n-1)` `a030530_list = 0 : concatMap (\n -> unfoldr` `(\x -> if x == 0 then Nothing else Just (n, div x 2)) n) [1..]` `-- Reinhard Zumkeller, Dec 05 2011`
	CROSSREFS	`A030190(n) = T(a(n), A083652(a(n))-n-1), T as defined in A083651, a(A083652(k))=k+1.` `Sequence in context: A001462 A082462 A005041 * A084500 A084557 A024417` `Adjacent sequences: A030527 A030528 A030529 * A030531 A030532 A030533`
	KEYWORD	`easy,nonn`
	AUTHOR	`J. Lowell (jhbubby(AT)avana.net)`

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

Last modified February 14 17:10 EST 2012. Contains 205644 sequences.