id:A007538 - OEIS Search Results

Search: id:A007538

Displaying 1-1 of 1 results found.

page 1

A self-generating sequence: there are a(n) 3's between successive 2's.
(Formerly M0432)

+0
7

2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3, 3, 3, 2, 3 (list; graph; listen)

	OFFSET	`1,1`
	REFERENCES	`Problem A-6, Amer. Math. Monthly, 101 (1994), 727-728.` `Problem, Math. Mag., 67 (No. 2, 1994), 157-158.`
	FORMULA	`a(n)=[ n(1+sqrt(3)) ]-[ (n-1)(1+sqrt(3)) ].`
	CROSSREFS	`Sequence in context: A096006 A131294 A102313 this_sequence A025076 A110006 A137779` `Adjacent sequences: A007535 A007536 A007537 this_sequence A007539 A007540 A007541`
	KEYWORD	`nonn,easy,nice`
	AUTHOR	`njas, Simon Plouffe (plouffe(AT)math.uqam.ca)`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research