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!)
A254344 a(0) = 3; a(n+1) is the smallest number not in the sequence such that a(n+1) - Sum_{i=1..n} a(i) divides a(n+1) - Product_{i=1..n} a(i). 2
3, 1, 5, 6, 10, 18, 42, 80, 150, 36, 90, 70, 414, 140, 178, 954, 2180, 4290, 8586, 5460, 9670, 18200, 50544, 15938, 1560, 19500, 130000, 83226, 44352, 68362, 249704, 712866, 1265670, 111510, 510734, 3314542, 2236752, 8865822, 17731350, 2285220, 9196442 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
Hiroaki Yamanouchi, Table of n, a(n) for n = 0..59
PROG
(PARI) v=[3]; print1(3, ", "); n=1; while(n<10^4, p=prod(i=1, #v, v[i]); if(vecsum(v)!=n&&(p-n)\(vecsum(v)-n)==(p-n)/(vecsum(v)-n)&&!vecsearch(vecsort(v), n), v=concat(v, n); print1(n, ", "); n=0); n++)
CROSSREFS
Cf. A254343.
Sequence in context: A140950 A256504 A205713 * A278032 A016600 A130418
KEYWORD
nonn
AUTHOR
Derek Orr, Jan 29 2015
EXTENSIONS
a(38)-a(40) from Hiroaki Yamanouchi, Feb 24 2015
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 23 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)