|
|
|
|
7, 10, 13, 16, 19, 22, 25, 28, 31, 34, 37, 40, 43, 46, 49, 52, 55, 58, 61, 64, 67, 70, 73, 76, 79, 82, 85, 88, 91, 94, 97, 100, 103, 106, 109, 112, 115, 118, 121, 124, 127, 130, 133, 136, 139, 142, 145, 148, 151, 154, 157, 160, 163, 166, 169, 172, 175, 178, 181, 184
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,1
|
|
COMMENTS
|
At least the first 2 million terms from a(1) on coincide with the corresponding terms of A086822(n+2). - R. J. Mathar, Aug 15 2008
|
|
LINKS
|
|
|
FORMULA
|
a(n) = C(1+n,1)+C(2+n,1)+C(4+n,1).
|
|
EXAMPLE
|
If n=0 then C(1+0,1)+C(2+0,1)+C(4+0,1)= C(1,1)+ C( 2,1)+C( 4,1)=1+2+4=7
If n=21 then C(1+21,1)+C(2+21,1)+C(4+21,1)= C(22,1)+C(23,1)+C(25,1)= 22+23+25=70
|
|
MATHEMATICA
|
3Range[0, 70]+7 (* or *) LinearRecurrence[{2, -1}, {7, 10}, 70] (* Harvey P. Dale, May 12 2019 *)
|
|
PROG
|
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
Better definition from T. D. Noe, Nov 30 2006
|
|
STATUS
|
approved
|
|
|
|