|
Search: id:A007538
|
|
|
| A007538 |
|
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
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
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)) ].
a(n)=f(n,2,2,2) with f(n,b,c,i) = if n=1 then b else (if c=0 then f(n-1,2,a(i),i+1) else f(n-1,3,c-1,i)). [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), May 25 2009]
|
|
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
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
|
Search completed in 0.002 seconds
|
