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!)
A159458 Numbers m such that m^2 divides A159068(m), where A159068(m) = Sum_{k=1..m} binomial(m,k) * gcd(m,k). 1
1, 2, 3, 11, 33, 309, 665, 1461, 2323, 6789 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

m divides A159068(m) for all positive integers m.

LINKS

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

PROG

(PARI) is(m) = sum(k=1, m, binomial(m, k)*gcd(k, m))%m^2 == 0; \\ Jinyuan Wang, Aug 10 2021

CROSSREFS

Cf. A159068, A159069.

Sequence in context: A062630 A300771 A296005 * A305846 A057838 A219497

Adjacent sequences:  A159455 A159456 A159457 * A159459 A159460 A159461

KEYWORD

nonn,more

AUTHOR

Leroy Quet, Apr 12 2009

EXTENSIONS

4 more terms from R. J. Mathar, Apr 16 2009

a(10)=6789 from Ray Chandler, Jun 19 2009

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 October 1 17:46 EDT 2022. Contains 357149 sequences. (Running on oeis4.)