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!)
A325824 a(n) = A325814(A228058(n)). 5
27, 75, 99, 203, 171, 255, 219, 243, 171, 335, 315, 363, 539, 539, 435, 575, 531, 707, 767, 579, 603, 735, 651, 675, 815, 507, 819, 1055, 891, 675, 939, 1211, 1343, 1215, 1035, 1419, 1083, 1155, 1179, 1691, 1547, 1455, 1715, 1859, 1371, 1395, 1443, 759, 1775, 1539, 1179, 1611, 1935, 1659, 2015, 1683, 2219, 1755, 2507, 2175, 1875, 2255 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
COMMENTS
First negative term occurs as a(16307) = -210973, with A228058(16307) = 1289925. The next negative terms occurs as a(20807) = -242901, with A228058(20807) = 1686825.
LINKS
FORMULA
a(n) = A325814(A228058(n)).
a(n) = A325379(n) + A325823(n).
PROG
(PARI)
up_to = 10000;
isA228058(n) = if(!(n%2)||(omega(n)<2), 0, my(f=factor(n), y=0); for(i=1, #f~, if(1==(f[i, 2]%4), if((1==y)||(1!=(f[i, 1]%4)), return(0), y=1), if(f[i, 2]%2, return(0)))); (y));
A228058list(up_to) = { my(v=vector(up_to), k=0, n=0); while(k<up_to, n++; if(isA228058(n), k++; v[k] = n)); (v); };
v228058 = A228058list(up_to);
A228058(n) = v228058[n]; \\ Antti Karttunen, May 23 2019
A034448(n) = { my(f=factorint(n)); prod(k=1, #f~, 1+(f[k, 1]^f[k, 2])); }; \\ After code in A034448
A048146(n) = (sigma(n)-A034448(n));
A325814(n) = (n-A048146(n));
CROSSREFS
Cf. also A325320.
Sequence in context: A043237 A044017 A147651 * A163506 A226357 A255109
KEYWORD
sign
AUTHOR
Antti Karttunen, May 23 2019
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 July 18 13:34 EDT 2024. Contains 374378 sequences. (Running on oeis4.)