Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A075564
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A075564 Rearrangement of natural numbers such that n-th partial sum is == n (mod c(n)). where c(n) is the n-th composite number. +0
1
1, 7, 3, 2, 12, 5, 19, 4, 20, 9, 29, 6, 28, 13, 32, 8, 35, 37, 49, 21, 11, 45, 47, 85, 67, 16, 56, 33, 77, 18, 64, 133, 70, 22, 73, 23, 99, 24, 80, 25, 83, 51, 113, 27, 91, 93, 95, 59, 30, 100, 61, 135, 107, 109, 34, 112, 69, 116, 36, 71, 121, 123, 38, 126, 167, 40, 132, 41 (list; graph; listen)
OFFSET

1,2

CROSSREFS

Sequence in context: A132713 A135296 A098907 this_sequence A135041 A021581 A011299

Adjacent sequences: A075561 A075562 A075563 this_sequence A075565 A075566 A075567

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Sep 25 2002

EXTENSIONS

More terms from David Wasserman (dwasserm(AT)earthlink.net), Jan 19 2005

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 July 26 23:19 EDT 2008. Contains 142293 sequences.


AT&T Labs Research