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!)
A358860 a(n) is the smallest n-gonal pyramidal number divisible by exactly n n-gonal pyramidal numbers. 3
56, 140, 4200, 331800, 611520, 8385930, 1071856800, 41086892000, 78540000, 38102655397426620, 59089382788800, 22241349900, 2326493030400, 7052419469195100, 886638404171520 (list; graph; refs; listen; history; text; internal format)
OFFSET
3,1
COMMENTS
The corresponding indices of n-gonal pyramidal numbers are 6, 7, 20, 79, 90, 203, ...
LINKS
Eric Weisstein's World of Mathematics, Pyramidal Number
EXAMPLE
a(4) = 140, because 140 is a square pyramidal number that has 4 square pyramidal divisors {1, 5, 14, 140} and this is the smallest such number.
PROG
(PARI)
pyramidal(k, r)=(k*(k+1)*((r-2)*k + (5-r)))\6;
ispyramidal(n, r) = pyramidal(sqrtnint(6*n\(r-2) + sqrtnint(n, 3), 3), r) == n;
a(n) = if(n<3, return()); for(k=1, oo, my(t=pyramidal(k, n)); if(sumdiv(t, d, ispyramidal(d, n)) == n, return(t))); \\ Daniel Suteu, Dec 06 2022
CROSSREFS
Sequence in context: A241287 A201096 A358540 * A226128 A038850 A220042
KEYWORD
nonn,more
AUTHOR
Ilya Gutkovskiy, Dec 03 2022
EXTENSIONS
a(9)-a(17) from Daniel Suteu, Dec 06 2022
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 April 25 09:31 EDT 2024. Contains 371967 sequences. (Running on oeis4.)