login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A254343 a(0) = 1; 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
1, 2, 4, 6, 8, 10, 18, 32, 48, 126, 60, 162, 468, 210, 1050, 98, 2254, 154, 4704, 9380, 15750, 33810, 10584, 78498, 45096, 79780, 266760, 362190, 911262, 46260, 1862700, 3713700, 743052, 5023454, 13211688, 26120556, 52543890, 15624468, 48120150, 89142066 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

If a(0) = 2, the sequence is the same; only a(0) and a(1) switch places.

LINKS

Hiroaki Yamanouchi, Table of n, a(n) for n = 0..64

PROG

(PARI) v=[1]; print1(1, ", "); 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. A254344.

Sequence in context: A078106 A111082 A100433 * A157006 A221991 A279254

Adjacent sequences:  A254340 A254341 A254342 * A254344 A254345 A254346

KEYWORD

nonn

AUTHOR

Derek Orr, Jan 29 2015

EXTENSIONS

a(34)-a(39) 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 3 03:03 EST 2021. Contains 341756 sequences. (Running on oeis4.)