Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072349
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072349 a(n) = m such that A064388(m) = n, or 0 if no such m exists. +0
1
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; listen)
OFFSET

1,2

COMMENT

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 this_sequence A016518 A118202 A089331

Adjacent sequences: A072346 A072347 A072348 this_sequence A072350 A072351 A072352

KEYWORD

nonn

AUTHOR

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

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research