The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A324539 Number of divisors d of n such that A276086(d) = (n/d). 5
 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2250 COMMENTS a(n) tells how many times n occurs in A324580. See also comments in A324541. Question: Where is the next term larger than one in this sequence after a(2250) = 2 and a(5402250) = 2 ? Are there terms larger than 2 ? LINKS Antti Karttunen, Table of n, a(n) for n = 1..100000 Index entries for sequences related to primorial base Index entries for sequences related to primorial numbers FORMULA a(n) = Sum_{d|n} [d == A276086(n/d)], where [ ] is the Iverson bracket. PROG (PARI) A276086(n) = { my(i=0, m=1, pr=1, nextpr); while((n>0), i=i+1; nextpr = prime(i)*pr; if((n%nextpr), m*=(prime(i)^((n%nextpr)/pr)); n-=(n%nextpr)); pr=nextpr); m; }; A324539(n) = sumdiv(n, d, (d==A276086(n/d))); CROSSREFS Cf. A276086, A324540 (positions of zeros), A324541 (nonzeros), A324580. Sequence in context: A153638 A122415 A241666 * A324964 A285957 A292273 Adjacent sequences: A324536 A324537 A324538 * A324540 A324541 A324542 KEYWORD nonn AUTHOR Antti Karttunen, Mar 10 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.

Last modified July 18 09:18 EDT 2024. Contains 374378 sequences. (Running on oeis4.)