Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A352256 a(n) is the least k such that A033273(k) is equal to (A033273(n*k + 1) - 1)/n where A033273(n) is the number of nonprime divisors of n. 0
3, 13, 5, 41, 11, 2479, 23, 73, 103, 2249, 19, 7177, 211, 691, 3089, 1289, 53263, 726493, 41, 1597, 2243, 64406, 13129, 31351, 983, 1579, 197, 43037, 1411, 38246575, 389, 3607, 15403, 61286, 709, 1638349, 3587, 16249, 3585641, 1017119, 1292839, 132347, 593, 32203, 51963 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
EXAMPLE
a(2) = 13 because A033273(13) = (A033273(2*13 + 1) - 1)/2 = (A033273(27) - 1)/2 = 1.
MATHEMATICA
f[n_] := DivisorSigma[0, n] - PrimeNu[n]; a[n_] := Module[{k = 2}, While[f[k] != (f[n*k + 1] - 1)/n, k++]; k]; Array[a, 29] (* Amiram Eldar, Mar 10 2022 *)
PROG
(PARI) f(n) = numdiv(n) - omega(n); \\ A033273
a(n) = my(k=2); while (f(k) != (f(n*k + 1) - 1)/n, k++); k; \\ Michel Marcus, Mar 10 2022
CROSSREFS
Sequence in context: A331806 A331807 A084738 * A073580 A340349 A326609
KEYWORD
nonn
AUTHOR
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 18 13:06 EDT 2024. Contains 375269 sequences. (Running on oeis4.)