|
Search: id:A118113
|
|
|
| A118113 |
|
Even Fibbinary numbers + 1; also 2*Fibbinary(n)+1. |
|
+0
5
|
|
| 1, 3, 5, 9, 11, 17, 19, 21, 33, 35, 37, 41, 43, 65, 67, 69, 73, 75, 81, 83, 85, 129, 131, 133, 137, 139, 145, 147, 149, 161, 163, 165, 169, 171, 257, 259, 261, 265, 267, 273, 275, 277, 289, 291, 293, 297, 299, 321, 323, 325, 329, 331, 337, 339, 341, 513, 515, 517
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
a(n)=A022340(n)+1=2*A003714(n)+1
|
|
FORMULA
|
Solutions to {x : Mod(C(3x,x),x+1) != 0 } are given in A022341. The corresponding values of C(3x,x) mod x+1 are given here.
|
|
MAPLE
|
t=Table[Mod[Binomial[3*k, k], k+1], {k, 1, 3000}] Complement[t, Flatten[Position[t, 0]]] without 0.
|
|
CROSSREFS
|
Cf. A000108, A118112, A022341.
Cf. A003714 (Fibbinary numbers), A022340 (even Fibbinary numbers).
Sequence in context: A036696 A111039 A114512 this_sequence A076193 A056533 A114186
Adjacent sequences: A118110 A118111 A118112 this_sequence A118114 A118115 A118116
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Labos E. (labos(AT)ana1.sote.hu), Apr 13 2006
|
|
EXTENSIONS
|
New definition from T. D. Noe (noe(AT)sspectra.com), Dec 19 2006
|
|
|
Search completed in 0.002 seconds
|
