id:A078633 - OEIS Search Results

Search: id:A078633

Displaying 1-1 of 1 results found.

page 1

Smallest number of matches of length 1 needed to construct n squares with sides of length 1.

+0
3

4, 7, 10, 12, 15, 17, 20, 22, 24, 27, 29, 31, 34, 36, 38, 40, 43, 45, 47, 49, 52, 54, 56, 58, 60, 63, 65, 67, 69, 71, 74, 76, 78, 80, 82, 84, 87, 89, 91, 93, 95, 97, 100, 102, 104, 106, 108, 110, 112, 115, 117, 119, 121, 123, 125, 127, 130, 132, 134, 136, 138, 140, 142 (list; graph; listen)

	OFFSET	`1,1`
	FORMULA	`a(n)=2n+ceil(2sqrt(n)).` `a(n) = (4n + A027709(n))/2. - Tanya Khovanova (tanyakh(AT)yahoo.com), Mar 07 2008`
	EXAMPLE	`a(2)=7 because we have following construction (ignore the dots):` `._ _.` `\| \| \|` `.- -.`
	CROSSREFS	`Cf. A135708.` `Sequence in context: A097703 A104036 A050173 this_sequence A103762 A080734 A104280` `Adjacent sequences: A078630 A078631 A078632 this_sequence A078634 A078635 A078636`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`Mambetov Timur, Takenov Nurdin (timur_teufel(AT)mail.ru), Dec 12 2002`

page 1

Search completed in 0.002 seconds

Last modified September 8 08:06 EDT 2008. Contains 143486 sequences.

AT&T Labs Research