|
Search: id:A095161
|
|
|
| A095161 |
|
n occurs n times, with distinct successive terms. |
|
+0
5
|
|
| 1, 2, 3, 2, 3, 4, 3, 5, 4, 5, 4, 5, 4, 5, 6, 5, 7, 6, 7, 6, 7, 6, 7, 6, 7, 6, 8, 7, 8, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 10, 9, 10, 9, 10, 9, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 10, 11, 12, 11, 12, 11, 12, 11
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
A different sequence with the same definition is 1, 2, 3, 2, 3, 4, 3, 4, 5, 4, 5, 4, 5, 6, 5, 6, 5, 6, 7, 6, 7, 6, 7, 6, 7, 8, 7, 8, 7, 8, 7, 8, 9, 8, 9, 8, 9, 8, 9, 8, 9, 10, .. This would follow a more regular construction principle, that is, placing low numbers as early as possible: here a(7)=4 instead of a(7)=5 etc. - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Sep 25 2006
|
|
CROSSREFS
|
Cf. A095162.
Sequence in context: A045670 A111439 A020986 this_sequence A072106 A124524 A124525
Adjacent sequences: A095158 A095159 A095160 this_sequence A095162 A095163 A095164
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 01 2004
|
|
|
Search completed in 0.002 seconds
|
