|
| |
|
|
A115836
|
|
Self-describing sequence. The n-th integer of the sequence indicates how many integers of the sequence are strictly < 2n.
|
|
0
| |
|
|
1, 2, 4, 5, 6, 8, 10, 11, 12, 13, 14, 16, 18, 20, 22, 23, 24, 25, 26, 27, 28, 29, 30, 32, 34, 36, 38, 40, 42, 44, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 95, 96, 97, 98, 99, 100, 101
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Terms computed by Gilles Sadowski. In building step by step the sequence one has sometimes the choice for an integer. If so take the smallest available one.
|
|
|
FORMULA
| a(n) = A007378(n+1)-2 - Benoit Cloitre (benoit7848c(AT)orange.fr), May 22 2008
|
|
|
EXAMPLE
| A(7)=10 because there are 10 integers in the sequence which are strictly < 14 (they are 1,2,4,5,6,8,10,11,12,13)
|
|
|
CROSSREFS
| Cf. A080653.
Sequence in context: A169956 A035500 A080653 * A176554 A050505 A047262
Adjacent sequences: A115833 A115834 A115835 * A115837 A115838 A115839
|
|
|
KEYWORD
| base,easy,nonn
|
|
|
AUTHOR
| Eric Angelini (eric.angelini(AT)kntv.be), Feb 01 2006
|
| |
|
|
