This site is supported by donations to The OEIS Foundation.

 Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A063844 Smith numbers which are also base-2 pseudoprimes. 0
 645, 4369, 13747, 15709, 88357, 157641, 642001, 656601, 1507963, 2269093, 2313697, 4101637, 7428421, 7429117, 8388607, 22669501, 26296401, 27218269, 27336673, 28011001, 32701297, 34487601, 36507801, 37167361, 47903701, 54215161, 71804161, 72498253, 74411131, 82279741, 86438857, 86530621, 93614521, 96135601, 97863529 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS EXAMPLE 645 is a member since 645=3*5*43, sum of digits of 645 is 6+4+5=15, sum of digits of prime factors = 3+5+4+3=15 and 2^644 (mod 645) == 1. MATHEMATICA fQ[n_] := Block[{id = Sort@ IntegerDigits@ n, fid = Sort@ Flatten[ IntegerDigits@ Table[#[[1]], {#[[2]]}] & /@ FactorInteger@ n]}, While[ id[[1]] == 0, id = Drop[id, 1]]; While[ fid[[1]] == 0, fid = Drop[fid, 1]]; id != fid && Plus @@ id == Plus @@ fid]; k = 1; lst = {}; While[k < 10^8, !PrimeQ@ k && PowerMod[2, k-1, k] == 1, AppendTo[lst, k]]; k++]; Select[ lst, fQ] CROSSREFS Sequence in context: A100873 A227136 A216364 * A265684 A067845 A057942 Adjacent sequences:  A063841 A063842 A063843 * A063845 A063846 A063847 KEYWORD base,nonn AUTHOR Shyam Sunder Gupta, Aug 25 2001 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 14 09:20 EST 2018. Contains 318091 sequences. (Running on oeis4.)