|
Search: id:A095879
|
|
|
| A095879 |
|
Numbers n such that Lazy Fibonacci representation has odd number of summands. |
|
+0
2
|
|
| 1, 2, 6, 8, 9, 10, 12, 13, 15, 19, 20, 24, 27, 29, 30, 31, 35, 37, 38, 39, 42, 43, 44, 46, 47, 49, 53, 55, 56, 57, 59, 60, 62, 66, 67, 68, 70, 74, 75, 79, 82, 84, 85, 86, 88, 89, 91, 95, 96, 100, 103, 105, 106, 107, 109, 113, 116, 118, 119, 120, 124, 126, 127, 128, 131, 132
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
EXAMPLE
|
The first few Lazy Fibonacci representations (as in A095791) are 1=1, 2=2, 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 1, 2, 6, 8.
|
|
CROSSREFS
|
Cf. A095880, A095881.
Sequence in context: A064165 A003610 A077477 this_sequence A120736 A130099 A047397
Adjacent sequences: A095876 A095877 A095878 this_sequence A095880 A095881 A095882
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Clark Kimberling (ck6(AT)evansville.edu), Jun 10 2004
|
|
|
Search completed in 0.002 seconds
|
