A140195 - OEIS

This site is supported by donations to The OEIS Foundation.

A140195

Same as A140191 except here e=9.

1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 2, 2, 4, 1, 2, 2, 4, 1, 1, 1, 1, 2, 2, 2, 2, 1, 2, 1, 2, 2, 4, 2, 4, 1, 1, 2, 2, 2, 2, 4, 4, 1, 2, 2, 4, 2, 4, 4, 8, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 3, 2, 3, 2, 3, 1, 2, 2, 3, 1, 2, 2, 3, 2, 4, 4, 7, 2, 4, 4, 7, 1, 1, 1, 2, 2, 2, 2, 3, 2 (list; graph; refs; listen; history; internal format)

	OFFSET	`0,10`
	LINKS	`Nadia Heninger and N. J. A. Sloane, Table of n, a(n) for n = 0..3000`
	PROG	`See link in A140191 for Fortran program.`
	CROSSREFS	`Sequence in context: A107279 A078461 A111621 * A196564 A196563 A198890` `Adjacent sequences: A140192 A140193 A140194 * A140196 A140197 A140198`
	KEYWORD	`nonn`
	AUTHOR	`Nadia Heninger (nadiah(AT)cs.princeton.edu) and N. J. A. Sloane (njas(AT)research.att.com), Jun 06 2008`

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

Last modified February 17 00:09 EST 2012. Contains 205978 sequences.