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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156748 a(1)=a(2)=a(3)=a(4)=0, then a(n)=abs(a(n-1)-a(n-2)+2*a(n-3)-a(n-4))-a(n-3)-1 0
-1, 0, 0, 2, 2, -1, -2, -2, 4, 4, 3, 4, 0, -2, -2, 3, 2, 4, 6, 0, -5, -4, 4, 6, 4, 5, 2, -4, -6, 0, 7, 6, 4, 4, -2, -1, 0, 8, 8, 0, -1, -2, 8, 8, 4, 5, 0, 0, 0, 4, 3, 0, 0, -2, 4, 5, 4, 4, 0, -4, -5, 4, 4, 10, 14, 3, -6, -6, 4, 10, 5, 4, 4, -6, 2, 7, 16, 16, 4, -4, -9, 8, 8, 22, 30, 7, -10, -10, 8 (list; graph; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

There are 6 accumulation points for the sequence {a(n)/n} namely: -0.2, 0, 0.2, 0.4, 0.6 and 0.8.

CROSSREFS

Cf. A104156

Sequence in context: A071457 A115034 A027869 * A075445 A194447 A077766

Adjacent sequences:  A156745 A156746 A156747 * A156749 A156750 A156751

KEYWORD

sign

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Feb 14 2009

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 16 21:51 EST 2012. Contains 205978 sequences.