|
| |
|
|
A095880
|
|
Numbers n such that Lazy Fibonacci representation has even number of summands.
|
|
1
| |
|
|
3, 4, 5, 7, 11, 14, 16, 17, 18, 21, 22, 23, 25, 26, 28, 32, 33, 34, 36, 40, 41, 45, 48, 50, 51, 52, 54, 58, 61, 63, 64, 65, 69, 71, 72, 73, 76, 77, 78, 80, 81, 83, 87, 90, 92, 93, 94, 97, 98, 99, 101, 102, 104, 108, 110, 111, 112, 114, 115, 117, 121, 122, 123, 125, 129, 130
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
EXAMPLE
| The first few Lazy Fibonacci representations (as in A095791) are 1=1, 2=2, 3=2+1, 4=3+1, 5=3+2, 6=3+2+1, 7=5+2, 8=5+2+1, so that a(1), a(2), a(3) and a(4) are 3,4,5,7.
|
|
|
CROSSREFS
| Cf. A095879, A095881.
Sequence in context: A001605 A101762 A139455 * A076497 A137950 A046413
Adjacent sequences: A095877 A095878 A095879 * A095881 A095882 A095883
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Clark Kimberling (ck6(AT)evansville.edu), Jun 10 2004
|
| |
|
|
