Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068410
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068410 Numbers n such that (n+1) is composite and (n+1) divides 3^n-2^n. +0
1
64, 132, 528, 792, 1104, 1648, 1728, 2058, 2320, 2464, 2700, 2820, 4186, 5184, 6304, 6540, 6600, 6696, 6816, 7470, 7612, 8112, 8910, 10584, 10962, 11520, 13212, 13332, 13426, 14700, 14980, 15840, 18720, 19170, 19200, 19908, 21348, 21666, 22176 (list; graph; listen)
OFFSET

1,1

COMMENT

From little Fermat theorem, if (n+1) is prime (n+1) divides 3^n-2^n

CROSSREFS

Adjacent sequences: A068407 A068408 A068409 this_sequence A068411 A068412 A068413

Sequence in context: A076470 A031464 A045076 this_sequence A110232 A044315 A044696

KEYWORD

easy,nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 08 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 October 15 20:12 EDT 2008. Contains 145099 sequences.


AT&T Labs Research