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!)
A345058 Number of distinct k > 0 for which A011772(k) = n. 3
1, 2, 1, 3, 2, 2, 2, 7, 4, 2, 2, 4, 4, 3, 1, 5, 4, 4, 3, 7, 2, 3, 2, 7, 6, 4, 3, 3, 4, 7, 4, 13, 3, 4, 2, 4, 6, 3, 4, 7, 6, 3, 4, 7, 1, 5, 2, 7, 11, 6, 2, 7, 4, 5, 2, 11, 3, 4, 2, 7, 8, 5, 5, 7, 2, 3, 4, 4, 5, 3, 4, 13, 9, 6, 6, 9, 2, 4, 4, 8, 15, 6, 2, 11, 3, 3, 3, 7, 6, 3, 1, 5, 4, 7, 3, 13, 10, 11, 7, 6, 6, 5, 4, 8, 2 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
Question: Are there any numbers n other than 1, 3, 15, 45, 91 for which a(n) = 1?
LINKS
FORMULA
a(n) = Sum_{i=1..A000217(n)} [A011772(i) = A011772(n)], where [ ] is the Iverson bracket.
EXAMPLE
A011772 obtains the value 6 only as A011772(7)=6 and A011772(36)=6, therefore a(6) = 2.
PROG
(PARI)
A011772(n) = { if(n==1, return(1)); my(f=factor(if(n%2, n, 2*n)), step=vecmax(vector(#f~, i, f[i, 1]^f[i, 2]))); forstep(m=step, 2*n, step, if(m*(m-1)/2%n==0, return(m-1)); if(m*(m+1)/2%n==0, return(m))); }; \\ From A011772
A345058(n) = { my(x=A011772(n), y=binomial(x+1, 2)); sum(i=1, y, (A011772(i)==x)); };
CROSSREFS
Sequence in context: A177062 A133924 A023135 * A191654 A327983 A372196
KEYWORD
nonn
AUTHOR
Antti Karttunen, Jun 07 2021
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 19:26 EDT 2024. Contains 375273 sequences. (Running on oeis4.)