Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A096027
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A096027 Numbers n such that (n+j) mod (2+j) = 1 for j from 0 to 10 and (n+11) mod 13 <> 1. +0
6
27723, 55443, 83163, 110883, 138603, 166323, 194043, 221763, 249483, 277203, 304923, 332643, 388083, 415803, 443523, 471243, 498963, 526683, 554403, 582123, 609843, 637563, 665283, 693003, 748443, 776163, 803883, 831603, 859323, 887043 (list; graph; listen)
page 1

Search completed in 0.001 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 December 17 19:39 EST 2009. Contains 170821 sequences.

AT&T Labs Research

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