|
|
|
|
|
|
|
|
|
#11 by Harvey P. Dale at Sun May 12 14:13:37 EDT 2019
|
|
|
|
|
|
|
|
#10 by Harvey P. Dale at Sun May 12 14:13:35 EDT 2019
|
|
| MATHEMATICA
|
3Range[0, 70]+7 (* or *) LinearRecurrence[{2, -1}, {7, 10}, 70] (* Harvey P. Dale, May 12 2019 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#9 by Charles R Greathouse IV at Sun Jul 10 23:48:23 EDT 2016
|
|
|
|
|
|
|
|
#8 by Charles R Greathouse IV at Sun Jul 10 23:47:34 EDT 2016
|
|
| COMMENTS
|
At least the first 2 million terms from a(1) on coincide with the corresponding terms of A086822(n+2). [From _). - _R. J. Mathar_, Aug 15 2008]
|
|
| LINKS
|
<a href="/index/Rec#order_02">Index entries for linear recurrences with constant coefficients</a>, signature (2,-1).
|
|
| PROG
|
(PARI) a(n)=3*n+7 \\ Charles R Greathouse IV, Jul 10 2016
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#7 by N. J. A. Sloane at Wed Oct 09 02:24:24 EDT 2013
|
|
| AUTHOR
|
_Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), _, Dec 09 2005
|
|
|
|
|
Discussion
|
| Wed Oct 09
| 02:24
| OEIS Server: https://oeis.org/edit/global/1991
|
|
|
|
|
|
|
#6 by Russ Cox at Fri Mar 30 17:39:07 EDT 2012
|
|
| COMMENTS
|
At least the first 2 million terms from a(1) on coincide with the corresponding terms of A086822(n+2). [From _R. J. Mathar (mathar(AT)strw.leidenuniv.nl), _, Aug 15 2008]
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 17:39
| OEIS Server: https://oeis.org/edit/global/190
|
|
|
|
|
|
|
#5 by Russ Cox at Fri Mar 30 17:22:41 EDT 2012
|
|
| EXTENSIONS
|
Better definition from _T. D. Noe (noe(AT)sspectra.com), _, Nov 30 2006
|
|
|
|
|
Discussion
|
| Fri Mar 30
| 17:22
| OEIS Server: https://oeis.org/edit/global/120
|
|
|
|
|
|
|
#4 by N. J. A. Sloane at Fri Jan 09 03:00:00 EST 2009
|
|
| COMMENTS
|
At least the first 2 million terms from a(1) on coincide with the corresponding terms of A086822(n+2). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 15 2008]
|
|
| KEYWORD
|
easy,nonn,new
|
|
|
|
|
|
|
#3 by N. J. A. Sloane at Fri May 11 03:00:00 EDT 2007
|
|
| LINKS
|
Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/RecursiveSequences.html">Recursive Sequences</a>
|
|
| KEYWORD
|
easy,nonn,new
|
|
|
|
|
|
|
#2 by N. J. A. Sloane at Wed Dec 06 03:00:00 EST 2006
|
|
| NAME
|
C(1+n,1)+C(2+n,1)+C(4+n,1).
3n+7.
|
|
| FORMULA
|
a(n) = C(1+n,1)+C(2+n,1)+C(4+n,1).
|
|
| EXTENSIONS
|
Better definition from T. D. Noe (noe(AT)sspectra.com), Nov 30 2006
|
|
|
|
|
|
