Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A007495
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A007495 Josephus problem: survivors.
(Formerly M0237)
+0
6
1, 1, 2, 2, 2, 4, 5, 4, 8, 8, 7, 11, 8, 13, 4, 11, 12, 8, 12, 2, 13, 7, 22, 2, 8, 13, 26, 4, 26, 29, 17, 27, 26, 7, 33, 20, 16, 22, 29, 4, 13, 22, 25, 14, 22, 37, 18, 46, 42, 46, 9, 41, 12, 7, 26, 42, 24, 5, 44, 53, 52, 58, 29, 22 (list; graph; listen)
OFFSET

1,3

REFERENCES

Friend H. Kierstead, Jr., Computer Challenge Corner, J. Rec. Math., 10 (1977), see p. 124.

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

CROSSREFS

Cf. A032434

Sequence in context: A089819 A059888 A024681 this_sequence A122385 A035002 A032578

Adjacent sequences: A007492 A007493 A007494 this_sequence A007496 A007497 A007498

KEYWORD

easy,nonn

AUTHOR

njas, Robert G. Wilson v (rgwv(AT)rgwv.com)

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 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research