Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096025 Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 6 and (n+7) mod 9 <> 1. +0
6
843, 1683, 3363, 4203, 5883, 6723, 8403, 9243, 10923, 11763, 13443, 14283, 15963, 16803, 18483, 19323, 21003, 21843, 23523, 24363, 26043, 26883, 28563, 29403, 31083, 31923, 33603, 34443, 36123, 36963, 38643, 39483, 41163, 42003, 43683 (list; graph; listen)
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 30 13:13 EST 2009. Contains 167758 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.