|
| |
|
|
A047208
|
|
Numbers that are congruent to {0, 4} mod 5.
|
|
23
| |
|
|
0, 4, 5, 9, 10, 14, 15, 19, 20, 24, 25, 29, 30, 34, 35, 39, 40, 44, 45, 49, 50, 54, 55, 59, 60, 64, 65, 69, 70, 74, 75, 79, 80, 84, 85, 89, 90, 94, 95, 99, 100, 104, 105, 109, 110, 114, 115, 119, 120, 124, 125, 129, 130, 134, 135, 139, 140, 144, 145, 149
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,2
|
|
|
COMMENTS
| Also solutions to 3^x + 5^x == 2 mod 11. - Cino Hilliard (hillcino368(AT)gmail.com), May 18 2003
|
|
|
LINKS
| Cino Hilliard, solutions to 3^x + 5^x == 2 mod 11/
Index to sequences with linear recurrences with constant coefficients, signature (1,1,-1).
|
|
|
FORMULA
| G.f.: x^2(4+x)/((1-x)^2(1+x)). a(n)=a(n-2)+5. [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 24 2009]
a(n)=(1/4)*[3-3*(-1)^n+10*n], with n>=0 [From Paolo P. Lava (paoloplava(AT)gmail.com), Feb 10 2009]
a(n)=5*n-a(n-1)-6 (with a(1)=0) [From Vincenzo Librandi, Nov 18 2010]
a(n+1)=Sum_k>=0 {A030308(n,k)*b(k)} with b(0)=4 and b(k)=A020714(k-1)=5*2^(k-1) for k>0. - From DELEHAM Philippe, Oct 17 2011.
|
|
|
MATHEMATICA
| Select[Range[0, 200], MemberQ[{0, 4}, Mod[#, 5]] &] (* From Vladimir Joseph Stephan Orlovsky, Feb 12 2012 *)
|
|
|
PROG
| (PARI) forstep(n=0, 200, [4, 1], print1(n", ")) \\ Charles R Greathouse IV, Oct 17 2011
|
|
|
CROSSREFS
| Cf. A010685 (first differences).
Sequence in context: A064473 A001983 A143575 * A177887 A032381 A191888
Adjacent sequences: A047205 A047206 A047207 * A047209 A047210 A047211
|
|
|
KEYWORD
| nonn,easy,changed
|
|
|
AUTHOR
| N. J. A. Sloane (njas(AT)research.att.com).
|
| |
|
|
