A114890 - OEIS

This site is supported by donations to The OEIS Foundation.

A114890

First differences of A114889.

2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 15, 2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 42, 2, 1, 3, 2, 1, 1, 1, 1, 6, 2, 1, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 (list; graph; refs; listen; history; internal format)

	OFFSET	`1,1`
	FORMULA	`Conjecture. a(1)=2 and, for n>1, a(n)=1+3+9+...+3^(k-1) + 2, if n=3^k, a(n)=a(n-3^k), if 3^k < n < 2*3^k - 1, else a(n)=1. (This has been verified for n<=3000.)`
	CROSSREFS	`Cf. A114889.` `Sequence in context: A191360 A144029 A166949 * A145327 A023512 A088192` `Adjacent sequences: A114887 A114888 A114889 * A114891 A114892 A114893`
	KEYWORD	`nonn`
	AUTHOR	`John W. Layman (layman(AT)math.vt.edu), Jan 04 2006`

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

Last modified February 16 10:53 EST 2012. Contains 205904 sequences.