A287896 - OEIS

This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

A287896

a(n) = A002487(n)*A001511(n).

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

	OFFSET	`1,2`
	COMMENTS	`Proposed name: N-fusc.` `Each number n>0 appears in this sequence exactly n times.`
	LINKS	`I. V. Serov, Table of n, a(n) for n = 1..8192`
	FORMULA	`a(1) = 1; for n>1: a(n) = (A002487(n-1) + A002487(n) + A002487(n+1))/2.` `a(n) = A007306(n) - A288002(n).`
	MATHEMATICA	`Table[Block[{a = 1, b = 0, m = n}, While[m > 0, If[OddQ@ m, b = a + b, a = a + b]; m = Floor[m/2]]; b] IntegerExponent[2 n, 2], {n, 89}] (* Michael De Vlieger, Jun 14 2017, after Jean-François Alcover at A002487 *)`
	CROSSREFS	`Cf. A001511, A002487, A007306, A288002.` `Sequence in context: A319856 A100197 A057022 * A087504 A067539 A166312` `Adjacent sequences: A287893 A287894 A287895 * A287897 A287898 A287899`
	KEYWORD	`nonn`
	AUTHOR	`I. V. Serov, Jun 02 2017`
	STATUS	`approved`

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 18 10:53 EST 2019. Contains 319271 sequences. (Running on oeis4.)