login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A047208 Numbers that are congruent to {0, 4} mod 5. 25
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; text; internal format)
OFFSET

1,2

COMMENTS

Also solutions to 3^x + 5^x == 2 mod 11. - Cino Hilliard, May 18 2003

LINKS

Table of n, a(n) for n=1..60.

Cino Hilliard, solutions to 3^x + 5^x == 2 mod 11/ [broken link]

Index entries for 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. - R. J. Mathar, Jan 24 2009

a(n)=(1/4)*[3-3*(-1)^n+10*n], with n>=0. - Paolo P. Lava, Feb 10 2009

a(n)=5*n-a(n-1)-6 (with a(1)=0). - 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. - Philippe Deléham, Oct 17 2011

a(n) = c((5/3)*c(3*n/2)), where c = ceiling. - Clark Kimberling, Jul 04 2012

MATHEMATICA

Select[Range[0, 200], MemberQ[{0, 4}, Mod[#, 5]] &] (* 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).

Cf. A274406.

Sequence in context: A064473 A001983 A143575 * A177887 A032381 A191888

Adjacent sequences:  A047205 A047206 A047207 * A047209 A047210 A047211

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified March 25 00:01 EDT 2017. Contains 284035 sequences.