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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072349 a(n) = m such that A064388(m) = n, or 0 if no such m exists. 0
1, 4, 2, 934, 932, 3, 5, 16, 14, 12, 10, 8, 6, 31, 29, 27, 25, 23, 236, 7, 9, 11, 13, 15, 17, 64, 62, 60, 58, 56, 54, 52, 50, 48, 46, 44, 42, 40 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Next term, a(39), is either 0 or greater than 400000. My guess is that this sequence is not computable, i.e. there is some n that does not occur in A064388, but it is impossible to prove this.

LINKS

Index entries for sequences related to Recaman's sequence

CROSSREFS

Cf. A057167.

Sequence in context: A096683 A158903 A152030 * A016518 A118202 A089331

Adjacent sequences:  A072346 A072347 A072348 * A072350 A072351 A072352

KEYWORD

nonn

AUTHOR

David Wasserman (wasserma(AT)spawar.navy.mil), Jul 17 2002

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 17:46 EST 2012. Contains 205939 sequences.