Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A095770
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A095770 First differences of A095769. +0
3
0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 0 (list; graph; listen)
OFFSET

1,1

REFERENCES

J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

PROGRAM

(PARI) v=vector(150, j, 1); for(n=3, 150, g=v[v[v[v[n-1]]]]+v[n-v[v[v[n-1]]]]; v[n]=g); a(n)=v[n+1]-v[n]

CROSSREFS

Cf. A004001, A093878, A095769, A095771.

Sequence in context: A130854 A112448 A101264 this_sequence A140318 A060584 A098725

Adjacent sequences: A095767 A095768 A095769 this_sequence A095771 A095772 A095773

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 05 2004

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research