login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A318761 Composite k that divides 2^(k-2) + 3^(k-2) + 6^(k-2) - 1. 2
4, 6, 8, 12, 24, 25, 125, 174, 228, 276, 325, 348, 451, 1032, 1105, 1128, 1729, 2388, 2465, 2701, 2821, 3721, 5272, 5365, 6601, 8911, 10585, 12025, 12673, 15841, 18721, 22681, 23585, 23725, 29341, 31621, 32376, 35016, 35425, 41041, 41125, 46632, 46657, 47125 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Note that for primes p >= 5, p always divides 2^(p-2) + 3^(p-2) + 6^(p-2) - 1 (see A318760).

It's interesting to study the squares of primes in this sequence. For primes p >= 5, x^(p^2-2) == x^(p-2) (mod p^2) for any integer x, so p^2 is a term if and only if p^2 divides 2^(p-2) + 3^(p-2) + 6^(p-2) - 1. It's easy to see that for any prime p, p^2 is a term of this sequence if and only if p is in A238201 and p != 3 (p = 2, 5, 61, 1680023, 7308036881, there are no others up to 7*10^10). - Jianing Song, Dec 25 2018

LINKS

Table of n, a(n) for n=1..44.

EXAMPLE

(2^10 + 3^10 + 6^10 - 1)/12 = 5403854 which is an integer, so 12 is a term.

(2^22 + 3^22 + 6^22 - 1)/24 = 5484238967813377 which is also an integer, so 24 is a term.

PROG

(PARI) b(n) = lift(Mod(2, n)^(n-2) + Mod(3, n)^(n-2) + Mod(6, n)^(n-2));

for(n=2, 30000, if(isprime(n)==0&&b(n)==1, print1(n, ", ")))

CROSSREFS

Cf. A238201, A318760.

A052155 is a proper subsequence.

Sequence in context: A146528 A216051 A176777 * A020153 A307866 A286373

Adjacent sequences:  A318758 A318759 A318760 * A318762 A318763 A318764

KEYWORD

nonn

AUTHOR

Jianing Song, Sep 02 2018

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 06:00 EST 2019. Contains 329350 sequences. (Running on oeis4.)