Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A156748
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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
-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; listen)
OFFSET

1,4

COMMENT

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 this_sequence A075445 A023572 A077766

Adjacent sequences: A156745 A156746 A156747 this_sequence A156749 A156750 A156751

KEYWORD

sign

AUTHOR

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

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 14:49 EST 2009. Contains 167514 sequences.


AT&T Labs Research