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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082999 A046195(n)%5. 1
1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1, 1, 1, 4, 1, 4, 0, 4, 0, 4, 0, 4, 1, 4, 1, 1 (list; graph; refs; listen; history; internal format)
OFFSET

1,3

COMMENTS

Sequence only consists of 0,1,4 mod 5

FORMULA

a(n)= +a(n-1) -a(n-3) +a(n-4) -a(n-6) +a(n-7) -a(n-9) +a(n-10) -a(n-12) +a(n-13). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2010]

EXAMPLE

a(2)=1 because A046195(2)=6=1 mod 5

MAPLE

Contribution from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2010: (Start)

A046195 := proc(n) option remember; if n <= 7 then op(n, [1, 6, 49, 961, 8214, 70225, 1385329 ]) ; else procname(n-1)+1442*procname(n-3) -1442*procname(n-4)-procname(n-6) +procname(n-7) ; end if; end proc:

A082999 := proc(n) A046195(n) mod 5 ; end proc: seq(A082999(n), n=1..120) ; (End)

CROSSREFS

Cf. A046195.

Sequence in context: A143354 A171539 A106141 * A010641 A165486 A100086

Adjacent sequences:  A082996 A082997 A082998 * A083000 A083001 A083002

KEYWORD

nonn

AUTHOR

Jon Perry (perry(AT)globalnet.co.uk), May 30 2003

EXTENSIONS

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jul 27 2010

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

Content is available under The OEIS End-User License Agreement .

Last modified February 14 06:48 EST 2012. Contains 205577 sequences.