Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A086335
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A086335 a[n] = a[(n - a[n-1])*(1-mod[n, 2])+a[n-1]*(mod[n, 2])] + a[(n - a[n-2])*(1-mod[n, 2]) +(n-a[n-1])*(mod[n, 2 ])] with a[1] = a[2] = 1. +0
5
1, 1, 2, 3, 3, 4, 5, 5, 6, 6, 7, 7, 9, 8, 10, 9, 11, 11, 12, 11, 13, 13, 15, 13, 16, 15, 17, 16, 18, 15, 19, 20, 20, 16, 21, 21, 22, 20, 23, 22, 25, 22, 26, 24, 26, 24, 28, 24, 29, 28, 31, 26, 32, 29, 33, 32, 36, 28, 35, 36, 37, 31, 39, 36, 39, 32, 41, 38, 39, 39, 43, 38, 41, 41 (list; graph; listen)
OFFSET

1,3

COMMENT

A Batrachian sequence that switches between Conway's and Hofstadter's sequences modulo 2.

MATHEMATICA

Hc[n_Integer?Positive] := Hc[n] =Hc[(n - Hc[n-1])*(1-Mod[n, 2])+Hc[n-1]*(Mod[n, 2])] + Hc[(n - Hc[n-2])*(1-Mod[n, 2])+(n-Hc[n-1])*(Mod[n, 2])] Hc[1] = Hc[2] = 1 Terms =202 a=Table[Hc[n], {n, 1, Terms }]

CROSSREFS

Cf. A004001, A005185. Complement gives A086451.

Adjacent sequences: A086332 A086333 A086334 this_sequence A086336 A086337 A086338

Sequence in context: A047785 A027923 A020888 this_sequence A123387 A123070 A057361

KEYWORD

nonn

AUTHOR

Roger L. Bagula (rlbagulatftn(AT)yahoo.com), Sep 01 2003

EXTENSIONS

Edited by njas, May 25 2006

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 October 12 12:59 EDT 2008. Contains 144830 sequences.


AT&T Labs Research