This site is supported by donations to The OEIS Foundation.



Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A014960 Numbers n such that n divides s(n), where s(1)=1, s(k)=s(k-1)+k*24^(k-1) (A014942). 7
1, 23, 529, 1081, 12167, 24863, 50807, 279841, 571849, 1168561, 2387929, 2870377 (list; graph; refs; listen; history; text; internal format)



Initial terms are 23^n, 23^(n-1)*47, 23^(n-2)*47^2,...23*47^(n-1),23^(n+1), etc. with sometime a little "noise" between terms (eg.: for a(12)=23*124799 between a(11)=23*47^3 and maybe a(13)=23^5). Maybe another sequence is interlaced, which would involve 23^n, 23^(n-1)*124799, etc., in which case an infinity of products of powers of 23 and powers of another prime factor may occur in the sequence. Conjecture: Next term, a(13), very probably is 23^5. Conjecture: All numbers in the sequence are multiple of 23. Conjecture: All numbers in the sequence have at most two different prime factors. - Thomas Baruchel, Oct 10 2003


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


s = 1; Do[ If[ Mod[ s, n ] == 0, Print[n]]; s = s + (n + 1)*24^n, {n, 1, 100000}]


Cf. A014942.

Sequence in context: A171328 A097778 A057193 * A207230 A207223 A207010

Adjacent sequences:  A014957 A014958 A014959 * A014961 A014962 A014963




Olivier Gérard


More terms from Robert G. Wilson v, Sep 13 2000

Four more terms from Thomas Baruchel, Oct 10 2003



Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 19 03:45 EST 2018. Contains 318245 sequences. (Running on oeis4.)