Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006972
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006972 Lucas-Carmichael numbers: square-free composite numbers n such that p | n => p+1 | n+1.
(Formerly M5450)
+0
3
399, 935, 2015, 2915, 4991, 5719, 7055, 8855, 12719, 18095, 20705, 20999, 22847, 29315, 31535, 46079, 51359, 60059, 63503, 67199, 73535, 76751, 80189, 81719, 88559, 90287, 104663, 117215, 120581, 147455, 152279, 155819, 162687, 191807 (list; graph; listen)
OFFSET

1,1

REFERENCES

J.-M. De Koninck, Ces nombres qui nous fascinent, Entry 399, p. 89, Ellipses, Paris 2008.

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

J. Perry, Lucas-Carmichael numbers

Index entries for sequences related to Carmichael numbers.

Wikipedia, Lucas-Carmichael number

MATHEMATICA

Select[ Range[ 2, 10^6 ], !PrimeQ[ # ] && Union[ Transpose[ FactorInteger[ # ] ][ [ 2 ] ] ] == {1} && Union[ Mod[ # + 1, Transpose[ FactorInteger[ # ] ][ [ 1 ] ] + 1 ] ] == {0} & ]

CROSSREFS

Sequence in context: A046013 A126231 A158317 this_sequence A065767 A166915 A110885

Adjacent sequences: A006969 A006970 A006971 this_sequence A006973 A006974 A006975

KEYWORD

nonn

AUTHOR

rgep(AT)chalcedon.demon.co.uk; Jeffrey Shallit

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research